Finding the sites with best accessibilities to amenities

Authors:
Qianlu Lin;Chuan Xiao;Muhammad Aamir Cheema;Wei Wang
Affiliations:
The University of New South Wales, Australia;The University of New South Wales, Australia;The University of New South Wales, Australia;The University of New South Wales, Australia
Venue:
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications: Part II
Year:
2011

Citing 17
Cited 2

The R*-tree: an efficient and robust access method for points and rectangles

SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Optimal multi-step k-nearest neighbor search

SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Incremental distance join algorithms for spatial databases

SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Distance browsing in spatial databases

ACM Transactions on Database Systems (TODS)
Adaptive multi-stage distance join processing

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
The K-D-B-tree: a search structure for large multidimensional dynamic indexes

SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
Evaluating Top-k Selection Queries

VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Group Nearest Neighbor Queries

ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Algorithms for processing K-closest-pair queries in spatial databases

Data & Knowledge Engineering
All-Nearest-Neighbors Queries in Spatial Databases

SSDBM '04 Proceedings of the 16th International Conference on Scientific and Statistical Database Management
The k-Nearest Neighbour Join: Turbo Charging the KDD Process

Knowledge and Information Systems
Conceptual partitioning: an efficient method for continuous nearest neighbor monitoring

Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Two ellipse-based pruning methods for group nearest neighbor queries

Proceedings of the 13th annual ACM international workshop on Geographic information systems
Progressive computation of the min-dist optimal-location query

VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Efficient method for maximizing bichromatic reverse nearest neighbor

Proceedings of the VLDB Endowment
Optimizing all-nearest-neighbor queries with trigonometric pruning

SSDBM'10 Proceedings of the 22nd international conference on Scientific and statistical database management
The optimal-location query

SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases

General spatial skyline operator

DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications - Volume Part I
Efficient general spatial skyline computation

World Wide Web

Quantified Score

Hi-index	0.00

Visualization

Abstract

Finding the most accessible locations has a number of applications. For example, a user may want to find an accommodation that is close to different amenities such as schools, supermarkets, and hospitals etc. In this paper, we study the problem of finding the most accessible locations among a set of possible sites. The task is converted to a top-k query that returns k points from a set of sites R with the best accessibilities. Two R-tree based algorithms are proposed to answer the query efficiently. Experimental results show that our proposed algorithms are several times faster than a baseline algorithm on large-scale real datasets under a wide range of parameter settings.