Filters








13,965 Hits in 6.2 sec

Efficient Processing of Spatial Group Keyword Queries

Xin Cao, Gao Cong, Tao Guo, Christian S. Jensen, Beng Chin Ooi
2015 ACM Transactions on Database Systems  
We define the problem of retrieving a group of spatio-textual objects such that the group's keywords cover the query's keywords and such that the objects are nearest to the query location and have the  ...  However, the queries studied so far generally focus on finding individual objects that each satisfy a query rather than finding groups of objects where the objects in a group together satisfy a query.  ...  In our problem, k is the number of query keywords. Thus we can adapt the greedy algorithm to process the SUM spatial group keyword query.  ... 
doi:10.1145/2772600 fatcat:2454p4o3jzgjdf6bqk6frvwsty

RASIM: a rank-aware separate index method for answering top-k spatial keyword queries

Hyuk-Yoon Kwon, Kyu-Young Whang, Il-Yeol Song, Haixun Wang
2012 World wide web (Bussum)  
Keywords top-k spatial keyword query · separate index · top-k pruning  ...  of the RA groups.  ...  Efficient query processing is based on the spatial index and the text index.  ... 
doi:10.1007/s11280-012-0159-3 fatcat:pk6in5ks6ffbratcyrikautaca

Single and Multiple Point Spatial Queries Supporting Keywords for Searching Nearest Neighbors

Komal K. Chhajed, Shailaja Jadhav
2015 2015 International Conference on Computing Communication Control and Automation  
Today's applications requesting for finding spatial objects closest to a specified location or within some range which satisfy constraint of keywords.  ...  Initially, spatial queries finding nearest neighbor or range queries having conditions on only geometric properties of object points.  ...  We are also thankful to all the staff members of the Department of Computer Engineering for their valuable time, support, comments, suggestions and persuasion.  ... 
doi:10.1109/iccubea.2015.97 fatcat:dywequxd5fewbhkr2obs2o3vfu

Single and Multiple point Spatial Queries Supporting Keywords for Searching Nearest Neighbors

Komal K.Chhajed, Shailaja Jadhav
2015 International Journal of Computer Applications  
Today's applications requesting for finding spatial objects closest to a specified location or within some range which satisfy constraint of keywords.  ...  Initially, spatial queries finding nearest neighbor or range queries having conditions on only geometric properties of object points.  ...  We are also thankful to all the staff members of the Department of Computer Engineering for their valuable time, support, comments, suggestions and persuasion.  ... 
doi:10.5120/19328-0842 fatcat:aifmjgnzmrgvhngh7sbgq4njzm

SWORS

Xin Cao, Gao Cong, Christian S. Jensen, Jun Jie Ng, Beng Chin Ooi, Nhan-Tue Phan, Dingming Wu
2012 Proceedings of the VLDB Endowment  
We present SWORS, the Spatial Web Object Retrieval System, that is capable of efficiently retrieving spatial web objects that satisfy spatial keyword queries.  ...  text relevancy; b) the spatial keyword group (SKG) query that retrieves a group of objects that cover the query keywords and are nearest to the query location and have the shortest inter-object distances  ...  SWORS exploits the IR-tree index [2] , which targets the efficient processing of spatial keyword queries, to process the location-aware top-k text retrieval (LkT) queries [2] as well as the spatial  ... 
doi:10.14778/2367502.2367536 fatcat:pm7jelfm2vd65aynjssvq3qfw4

G-Index Model: A generic model of index schemes for top-k spatial-keyword queries

Hyuk-Yoon Kwon, Haixun Wang, Kyu-Young Whang
2014 World wide web (Bussum)  
Third, we propose a cost model of the generated methods for the topk spatial-keyword query.  ...  For this, we show that G-Index Model can enumerate index schemes for two classes of queries: the spatial-keyword query (without the top-k constraint) and the top-k spatial-keyword-relational query, which  ...  Index structures Efficient query processing of top-k spatial-keyword queries relies on smart use of the spatial index and the text index.  ... 
doi:10.1007/s11280-014-0294-0 fatcat:xamnspocuff2rf4j2chuoktdym

Querying Geo-Textual Data

Gao Cong, Christian S. Jensen
2016 Proceedings of the 2016 International Conference on Management of Data - SIGMOD '16  
With a focus on different types of keyword-based queries on geo-textual data, the tutorial also explores topics such as continuous queries on streaming geo-textual data, queries that retrieve attractive  ...  Motivated in part by these developments, the research community has been hard at work enabling the efficient computation of a variety of query functionality on geo-textual data, yielding a sizable body  ...  A distributed solution [39] is proposed to process Boolean range queries and spatial group keyword queries on road networks.  ... 
doi:10.1145/2882903.2912572 dblp:conf/sigmod/CongJ16 fatcat:dyrffsyirvh3jk74mqb6qsos3m

Batch processing of Top-k Spatial-textual Queries

Farhana M. Choudhury, J. Shane Culpepper, Timos Sellis
2015 Second International ACM Workshop on Managing and Mining Enriched Geo-Spatial Data - GeoRich'15  
In this work, we study practical solutions to efficiently process a set of top-k spatial-textual queries.  ...  We propose an efficient best-first algorithm for the batch processing of top-k spatial-textual queries that promotes shared processing and reduced I/O in each query batch.  ...  Given a set of top-k spatial-textual queries, we propose an efficient algorithm that processes all of the queries concurrently using a best-first approach.  ... 
doi:10.1145/2786006.2786008 dblp:conf/sigmod/ChoudhuryCS15 fatcat:3ygnep7fbrbmfdx75gx7ujlgb4

Joint Top-K Spatial Keyword Query Processing

Dingming Wu, Man Lung Yiu, Gao Cong, Christian S. Jensen
2012 IEEE Transactions on Knowledge and Data Engineering  
We study the efficient, joint processing of multiple top-k spatial keyword queries.  ...  We propose a novel algorithm and index structure for the joint processing of top-k spatial keyword queries. Empirical studies show that the proposed solution is efficient on real datasets.  ...  Jensen is an Adjunct Professor at University of Agder, Norway. Man Lung Yiu was supported by ICRG grants A-PJ79 and G-U807 from the Hong Kong Polytechnic University.  ... 
doi:10.1109/tkde.2011.172 fatcat:253hb564o5h2dlvuce4ipwa3wu

Nearest Neighbor Browsing and Search with Keywords in Spatial Databases

Sphurti S. Sao, Dr. Rahila Sheikh
2016 International Journal Of Engineering And Computer Science  
bounding method that can answer the nearest neighbor queries with keywords in real time.  ...  Nowadays many modern applications aim to find objects satisfying both a spatial condition and a condition on their associated texts which is known as Spatial keyword search.  ...  [3] , proposed collective spatial keyword querying, they present the new problem of retrieving a group of spatial objects, each associated with a set of keywords.  ... 
doi:10.18535/ijecs/v5i5.42 fatcat:olfwcxipszepvm2utscnfwc3aa

Collective spatial keyword querying

Xin Cao, Gao Cong, Christian S. Jensen, Beng Chin Ooi
2011 Proceedings of the 2011 international conference on Management of data - SIGMOD '11  
We define the problem of retrieving a group of spatial web objects such that the group's keywords cover the query's keywords and such that objects are nearest to the query location and have the lowest  ...  With the proliferation of geo-positioning and geo-tagging, spatial web objects that possess both a geographical location and a textual description are gaining in prevalence, and spatial keyword queries  ...  Jensen is an adjunct professor at University of Agder, Norway. This research was supported in part by the Geocrowd project. REFERENCES  ... 
doi:10.1145/1989323.1989363 dblp:conf/sigmod/CaoCJO11 fatcat:rgf3rcocrvb4zodxpf6hn7alh4

A Personalized and Approximated Spatial Keyword Query Approach

Xiangfu Meng, Pan Li, Xiaoyan Zhang
2020 IEEE Access  
With the universal use of GPS and rapid increase of spatial Web objects, spatial keyword query has been widely used in Location-Based Services (LBS).  ...  To deal with these problems, this paper proposes a spatial keyword query method that can support semantic approximate query processing.  ...  The aim of this paper is to establish a spatial keyword query processing model and then proposes a corresponding effective hybrid index structure to improve the query efficiency.  ... 
doi:10.1109/access.2020.2977996 fatcat:52c5h43wfba7jf2sskryxcu7zy

Co-spatial Searcher: Efficient Tag-Based Collaborative Spatial Search on Geo-social Network [chapter]

Jinzeng Zhang, Xiaofeng Meng, Xuan Zhou, Dongqi Liu
2012 Lecture Notes in Computer Science  
This type of queries aim to retrieve groups of geographic objects that can satisfy a group of users' requirements expressed in tags, while ensuring that the objects be within the minimum spatial distance  ...  To answer TkCoS queries efficiently, we introduce a hybrid index structure called Spatial-Tag R-tree (STR-tree), which is an extension of the R-tree.  ...  The work [6] proposes the collective spatial keyword query, aiming to retrieve a group of spatial objects, such that the group's keywords cover the query's keywords and the objects are the nearest ones  ... 
doi:10.1007/978-3-642-29038-1_40 fatcat:4wdnxdxuara4nmh2gvxukth6bq

Spatial data mining for finding nearest neighbor and outlier detection

2016 International Journal of Latest Trends in Engineering and Technology  
Spatial databases support spatial indexing, efficient algorithms for processing spatial operations, and domain specific rules for query optimization.  ...  The major components of spatial database include a data model, query languages, processing and optimization tools, and indices.  ...  According to the ranking of answer set, top n query can be answered efficiently.  ... 
doi:10.21172/1.81.004 fatcat:i3zv2lin5navvh4safdbkr6gey

Efficient Processing of Top-k Spatial Keyword Queries [chapter]

João B. Rocha-Junior, Orestis Gkorgkas, Simon Jonassen, Kjetil Nørvåg
2011 Lecture Notes in Computer Science  
Moreover, we present algorithms that exploit S2I to process top-k spatial keyword queries efficiently.  ...  Given a spatial location and a set of keywords, a top-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  ...  -We propose efficient algorithms that exploit the S2I in order to process top-k spatial keyword queries efficiently.  ... 
doi:10.1007/978-3-642-22922-0_13 fatcat:c3tuy2dmabairdbxiymmqnaogu
« Previous Showing results 1 — 15 out of 13,965 results