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
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
A cost model for nearest neighbor search in high-dimensional data space
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
IEEE Transactions on Parallel and Distributed Systems
Incremental distance join algorithms for spatial databases
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Enhanced nearest neighbour search on the R-tree
ACM SIGMOD Record
An optimal algorithm for approximate nearest neighbor searching fixed dimensions
Journal of the ACM (JACM)
Selectivity estimation in spatial databases
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Distance browsing in spatial databases
ACM Transactions on Database Systems (TODS)
ACM Computing Surveys (CSUR)
Closest pair queries in spatial databases
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
The onion technique: indexing for linear optimization queries
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
A cost model for query processing in high dimensional data spaces
ACM Transactions on Database Systems (TODS)
Optimal aggregation algorithms for middleware
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Outlier detection for high dimensional data
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Combining fuzzy information: an overview
ACM SIGMOD Record
Top-k selection queries over relational databases: Mapping strategies and performance evaluation
ACM Transactions on Database Systems (TODS)
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Efficient Cost Models for Spatial Queries Using R-Trees
IEEE Transactions on Knowledge and Data Engineering
On the 'Dimensionality Curse' and the 'Self-Similarity Blessing'
IEEE Transactions on Knowledge and Data Engineering
Performance of Nearest Neighbor Queries in R-Trees
ICDT '97 Proceedings of the 6th International Conference on Database Theory
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Indexing the Distance: An Efficient Method to KNN Processing
Proceedings of the 27th International Conference on Very Large Data Bases
Efficient and Effective Clustering Methods for Spatial Data Mining
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Nearest Neighbor and Reverse Nearest Neighbor Queries for Moving Objects
IDEAS '02 Proceedings of the 2002 International Symposium on Database Engineering & Applications
K-Nearest Neighbor Search for Moving Query Point
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Spatial queries in dynamic environments
ACM Transactions on Database Systems (TODS)
Algorithms and applications for answering ranked queries using ranked views
The VLDB Journal — The International Journal on Very Large Data Bases
Group Nearest Neighbor Queries
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
IEEE Transactions on Knowledge and Data Engineering
Monitoring k-Nearest Neighbor Queries over Moving Objects
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
SEA-CNN: Scalable Processing of Continuous K-Nearest Neighbor Queries in Spatio-temporal Databases
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Query processing in spatial network databases
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Voronoi-based K nearest neighbor search for spatial network databases
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Challenges in spatiotemporal stream query optimization
MobiDE '06 Proceedings of the 5th ACM international workshop on Data engineering for wireless and mobile access
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Out-of-core coherent closed quasi-clique mining from large dense graph databases
ACM Transactions on Database Systems (TODS)
Continuous Nearest Neighbor Queries over Sliding Windows
IEEE Transactions on Knowledge and Data Engineering
A power-saving protocol for exact GkNN search in wireless broadcast environments
IWCMC '07 Proceedings of the 2007 international conference on Wireless communications and mobile computing
Ring-constrained join: deriving fair middleman locations from pointsets via a geometric constraint
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Aggregate similarity queries in relevance feedback methods for content-based image retrieval
Proceedings of the 2008 ACM symposium on Applied computing
Finding aggregate nearest neighbor efficiently without indexing
Proceedings of the 2nd international conference on Scalable information systems
Efficient Bounds in Finding Aggregate Nearest Neighbors
DEXA '08 Proceedings of the 19th international conference on Database and Expert Systems Applications
Indexing land surface for efficient kNN query
Proceedings of the VLDB Endowment
Proceedings of the 17th ACM conference on Information and knowledge management
Continuous visible nearest neighbor queries
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Efficient skyline computation in metric space
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Query optimization for spatio-temporal data stream management systems
SIGSPATIAL Special
On efficient mutual nearest neighbor query processing in spatial databases
Data & Knowledge Engineering
Processing spatial skyline queries in both vector spaces and spatial network databases
ACM Transactions on Database Systems (TODS)
Spatial Skyline Queries: An Efficient Geometric Algorithm
SSTD '09 Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases
Indexing 3-D human motion repositories for content-based retrieval
IEEE Transactions on Information Technology in Biomedicine - Special section on computational intelligence in medical systems
BerlinMOD: a benchmark for moving object databases
The VLDB Journal — The International Journal on Very Large Data Bases
Privacy preserving group nearest neighbor queries
Proceedings of the 13th International Conference on Extending Database Technology
Location privacy in geospatial decision-making
DNIS'07 Proceedings of the 5th international conference on Databases in networked information systems
Efficient methods in finding aggregate nearest neighbor by projection-based filtering
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part III
Voronoi-based aggregate nearest neighbor query processing in road networks
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
An efficient mechanism for processing similarity search queries in sensor networks
Information Sciences: an International Journal
VoR-tree: R-trees with Voronoi diagrams for efficient processing of spatial nearest neighbor queries
Proceedings of the VLDB Endowment
Flexible aggregate similarity search
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
A unified algorithm for continuous monitoring of spatial queries
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications: Part II
Aggregate farthest-neighbor queries over spatial data
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications: Part II
Continuous visible nearest neighbor query processing in spatial databases
The VLDB Journal — The International Journal on Very Large Data Bases
An incremental Hausdorff distance calculation algorithm
Proceedings of the VLDB Endowment
Retrieving k-nearest neighboring trajectories by a set of point locations
SSTD'11 Proceedings of the 12th international conference on Advances in spatial and temporal databases
MSSQ: manhattan spatial skyline queries
SSTD'11 Proceedings of the 12th international conference on Advances in spatial and temporal databases
Inverse queries for multidimensional spaces
SSTD'11 Proceedings of the 12th international conference on Advances in spatial and temporal databases
Spatial skyline queries: exact and approximation algorithms
Geoinformatica
Similarity search on a large collection of point sets
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Constrained shortest path computation
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
Approximating generalized distance functions on weighted triangulated surfaces with applications
Journal of Computational and Applied Mathematics
Single-Source multi-target a* algorithm for POI queries on road network
WAIM'11 Proceedings of the 2011 international conference on Web-Age Information Management
GLP: A cryptographic approach for group location privacy
Computer Communications
A time cost optimization for similar scenarios mobile GIS queries
Journal of Visual Languages and Computing
Fast k-clustering queries on embeddings of road networks
Proceedings of the 3rd International Conference on Computing for Geospatial Research and Applications
Aggregate nearest neighbor search methods using SSMTA* algorithm on road-network
ADBIS'12 Proceedings of the 16th East European conference on Advances in Databases and Information Systems
Aggregate keyword routing in spatial database
Proceedings of the 20th International Conference on Advances in Geographic Information Systems
The Farthest Spatial Skyline Queries
Information Systems
Continuous aggregate nearest neighbor queries
Geoinformatica
Approximate search algorithm for aggregate k-nearest neighbour queries on remote spatial databases
International Journal of Knowledge and Web Intelligence
A branch and bound method for min-dist location selection queries
ADC '12 Proceedings of the Twenty-Third Australasian Database Conference - Volume 124
Spatial inverse query processing
Geoinformatica
Saturn: a fast keyword kNN search system in road networks
WAIM'13 Proceedings of the 14th international conference on Web-Age Information Management
Reverse top-k group nearest neighbor search
WAIM'13 Proceedings of the 14th international conference on Web-Age Information Management
Efficient algorithms for spatial skyline query with uncertainty
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Group trip planning queries in spatial databases
SSTD'13 Proceedings of the 13th international conference on Advances in Spatial and Temporal Databases
A general framework for geo-social query processing
Proceedings of the VLDB Endowment
MSSQ: Manhattan Spatial Skyline Queries
Information Systems
Aggregate nearest neighbor queries in uncertain graphs
World Wide Web
Hi-index | 0.00 |
Given two spatial datasets P (e.g., facilities) and Q (queries), an aggregate nearest neighbor (ANN) query retrieves the point(s) of P with the smallest aggregate distance(s) to points in Q. Assuming, for example, n users at locations q1,…qn, an ANN query outputs the facility p ∈ P that minimizes the sum of distances |pqi| for 1 ≤ i ≤ n that the users have to travel in order to meet there. Similarly, another ANN query may report the point p ∈ P that minimizes the maximum distance that any user has to travel, or the minimum distance from some user to his/her closest facility. If Q fits in memory and P is indexed by an R-tree, we develop algorithms for aggregate nearest neighbors that capture several versions of the problem, including weighted queries and incremental reporting of results. Then, we analyze their performance and propose cost models for query optimization. Finally, we extend our techniques for disk-resident queries and approximate ANN retrieval. The efficiency of the algorithms and the accuracy of the cost models are evaluated through extensive experiments with real and synthetic datasets.