Results 1 - 10
of
1,862
Querying Heterogeneous Information Sources Using Source Descriptions
, 1996
"... We witness a rapid increase in the number of structured information sources that are available online, especially on the WWW. These sources include commercial databases on product information, stock market information, real estate, automobiles, and entertainment. We would like to use the data stored ..."
Abstract
-
Cited by 724 (34 self)
- Add to MetaCart
stored in these databases to answer complex queries that go beyond keyword searches. We face the following challenges: (1) Several information sources store interrelated data, and any query-answering system must understand the relationships between their contents. (2) Many sources are not full
Efficient processing of top-k spatial keyword queries
- In SSTD,2011
"... Abstract. Givenaspatiallocationandasetofkeywords,atop-k spatial keyword query returns the k best spatio-textual objects ranked according to their proximity to the query location and relevance to the query keywords. There are many applications handling huge amounts of geotagged data, such as Twitter ..."
Abstract
-
Cited by 16 (1 self)
- Add to MetaCart
and Flickr, that can benefit from this query. Unfortunately,thestate-of-the-artapproachesrequirenon-negligibleprocessing cost that incurs in long response time. In this paper, we propose a novel index to improve the performance of top-k spatial keyword queries named Spatial Inverted Index (S2I). Our index
Joint top-k spatial keyword query processing.
- IEEE TKDE,
, 2012
"... Abstract-Web users and content are increasingly being geo-positioned, and increased focus is being given to serving local content in response to web queries. This development calls for spatial keyword queries that take into account both the locations and textual descriptions of content. We study th ..."
Abstract
-
Cited by 7 (1 self)
- Add to MetaCart
the efficient, joint processing of multiple top-k spatial keyword queries. Such joint processing is attractive during high query loads and also occurs when multiple queries are used to obfuscate a user's true query. We propose a novel algorithm and index structure for the joint processing of top-k spatial
Social-aware top-k spatial keyword search
- In MDM
, 2014
"... Abstract—The boom of the spatial web has enabled spatial keyword queries that take a user location and multiple search keywords as arguments and return the objects that are spatially and textually relevant to these arguments. Recently, utilizing social data to improve search results, normally by giv ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
propose a novel spatial key-word query, Social-aware top-k Spatial Keyword (SkSK) query, which enriches the semantics of the conventional spatial keyword query by introducing a new social relevance attribute. A hybrid index structure, called Social Network-aware IR-tree (SNIR-tree), is proposed
Processing Spatial Keyword Query as a Top-k Aggregation Query
"... We examine the spatial keyword search problem to retrieve objects of interest that are ranked based on both their spatial proximity to the query location as well as the textual relevance of the object’s keywords. Existing solutions for the problem are based on either using a combination of textual a ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
and spatial indexes or using specialized hybrid indexes that integrate the indexing of both textual and spatial attribute values. In this paper, we propose a new approach that is based on modeling the problem as a top-k aggregation problem which enables the design of a scalable and efficient solution
Scalable Top-K Spatial Keyword Search”,
, 2013
"... ABSTRACT In this big data era, huge amounts of spatial documents have been generated everyday through various location based services. Top-k spatial keyword search is an important approach to exploring useful information from a spatial database. It retrieves k documents based on a ranking function ..."
Abstract
-
Cited by 7 (2 self)
- Add to MetaCart
faster in updates, and it is highly scalable and answers top-k spatial keyword queries efficiently.
Efficient continuously moving top-k spatial keyword query processing
- In ICDE
, 2011
"... Abstract—Web users and content are increasingly being geo-positioned. This development gives prominence to spatial key-word queries, which involve both the locations and textual descriptions of content. We study the efficient processing of continuously moving top- ..."
Abstract
-
Cited by 19 (4 self)
- Add to MetaCart
Abstract—Web users and content are increasingly being geo-positioned. This development gives prominence to spatial key-word queries, which involve both the locations and textual descriptions of content. We study the efficient processing of continuously moving top-
Efficient safe-region construction for moving top-k spatial keyword queries
- IN CIKM
, 2012
"... Many real-world applications have requirements to support moving spatial keyword queries. For example a tourist looksfortop-k “seafood restaurants” while walking in a city. She will continuously issue moving queries. However existing spatial keyword search methods focus on static queries and it call ..."
Abstract
-
Cited by 9 (6 self)
- Add to MetaCart
and it calls for new effective techniques to support moving queries efficiently. In this paper we propose an effective method to support moving top-k spatial keyword queries. In addition to finding top-k answers of a moving query, we also calculate a safe region such that if a new query with a location falling
1Joint Top-K Spatial Keyword Query Processing
"... Abstract—Web users and content are increasingly being geo-positioned, and increased focus is being given to serving local content in response to web queries. This development calls for spatial keyword queries that take into account both the locations and textual descriptions of content. We study the ..."
Abstract
- Add to MetaCart
the efficient, joint processing of multiple top-k spatial keyword queries. Such joint processing is attractive during high query loads and also occurs when multiple queries are used to obfuscate a user’s true query. We propose a novel algorithm and index structure for the joint processing of top-k spatial
Results 1 - 10
of
1,862