Abstract
Searches for objects associated with location information and non-spatial attributes have increased significantly over the years. To address this need, a top-k query may be issued by taking into account both the location information and non-spatial attributes. This paper focuses on a distance-based top-k query which retrieves the best objects based on distance from candidate objects to a query point as well as other non-spatial attributes. In this paper, we propose a new index structure and query processing algorithms for distance-based top-k queries. This new index, called SKY R-tree, drives on the strengths of R-tree and Skyline algorithm to efficiently prune the search space by exploring both the spatial proximity and non-spatial attributes. Moreover, we propose a variant of SKY R-tree, called S2KY R-tree which incorporates a similarity measure of non-spatial attributes. We demonstrate, through extensive experimentation, that our proposals perform very well in terms of I/O costs and CPU time.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 220-235 |
| Number of pages | 16 |
| Journal | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Volume | 8421 LNCS |
| Issue number | PART 1 |
| DOIs | |
| State | Published - Jan 1 2014 |
| Event | 19th International Conference on Database Systems for Advanced Applications, DASFAA 2014 - Bali, Indonesia Duration: Apr 21 2014 → Apr 24 2014 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Computer Science(all)
Cite this
}
SKY R-tree : An index structure for distance-based top-k query. / Sasaki, Yuya; Lee, Wang Chien; Hara, Takahiro; Nishio, Shojiro.
In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 8421 LNCS, No. PART 1, 01.01.2014, p. 220-235.Research output: Contribution to journal › Conference article
TY - JOUR
T1 - SKY R-tree
T2 - An index structure for distance-based top-k query
AU - Sasaki, Yuya
AU - Lee, Wang Chien
AU - Hara, Takahiro
AU - Nishio, Shojiro
PY - 2014/1/1
Y1 - 2014/1/1
N2 - Searches for objects associated with location information and non-spatial attributes have increased significantly over the years. To address this need, a top-k query may be issued by taking into account both the location information and non-spatial attributes. This paper focuses on a distance-based top-k query which retrieves the best objects based on distance from candidate objects to a query point as well as other non-spatial attributes. In this paper, we propose a new index structure and query processing algorithms for distance-based top-k queries. This new index, called SKY R-tree, drives on the strengths of R-tree and Skyline algorithm to efficiently prune the search space by exploring both the spatial proximity and non-spatial attributes. Moreover, we propose a variant of SKY R-tree, called S2KY R-tree which incorporates a similarity measure of non-spatial attributes. We demonstrate, through extensive experimentation, that our proposals perform very well in terms of I/O costs and CPU time.
AB - Searches for objects associated with location information and non-spatial attributes have increased significantly over the years. To address this need, a top-k query may be issued by taking into account both the location information and non-spatial attributes. This paper focuses on a distance-based top-k query which retrieves the best objects based on distance from candidate objects to a query point as well as other non-spatial attributes. In this paper, we propose a new index structure and query processing algorithms for distance-based top-k queries. This new index, called SKY R-tree, drives on the strengths of R-tree and Skyline algorithm to efficiently prune the search space by exploring both the spatial proximity and non-spatial attributes. Moreover, we propose a variant of SKY R-tree, called S2KY R-tree which incorporates a similarity measure of non-spatial attributes. We demonstrate, through extensive experimentation, that our proposals perform very well in terms of I/O costs and CPU time.
UR - http://www.scopus.com/inward/record.url?scp=84900297583&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84900297583&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-05810-8_15
DO - 10.1007/978-3-319-05810-8_15
M3 - Conference article
AN - SCOPUS:84900297583
VL - 8421 LNCS
SP - 220
EP - 235
JO - Lecture Notes in Computer Science
JF - Lecture Notes in Computer Science
SN - 0302-9743
IS - PART 1
ER -