Voronoi Diagrams for Query Processing

[1]  Antonin Guttman,et al.  R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.

[2]  Cyrus Shahabi,et al.  Processing Optimal Sequenced Route Queries Using Voronoi Diagrams , 2008, GeoInformatica.

[3]  Flip Korn,et al.  Influence sets based on reverse nearest neighbor queries , 2000, SIGMOD 2000.

[4]  Yufei Tao,et al.  Location-based spatial queries , 2003, SIGMOD '03.

[5]  Chun Zhang,et al.  Storing and querying ordered XML using a relational database system , 2002, SIGMOD '02.

[6]  Yufei Tao,et al.  Query Processing in Spatial Network Databases , 2003, VLDB.

[7]  Cyrus Shahabi,et al.  The spatial skyline queries , 2006, VLDB.

[8]  Cyrus Shahabi,et al.  Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases , 2004, VLDB.

[9]  Cyrus Shahabi,et al.  The optimal sequenced route query , 2008, The VLDB Journal.

[10]  Kyriakos Mouratidis,et al.  Constrained Shortest Path Computation , 2005, SSTD.

[11]  Michiel Hagedoorn.  Nearest Neighbors Can Be Found Efficiently If the Dimension Is Small Relative to the Input Size , 2003, ICDT.

[12]  George Kollios,et al.  Complex Spatio-Temporal Pattern Queries , 2005, VLDB.

[13]  Divyakant Agrawal,et al.  Discovery of Influence Sets in Frequently Updated Databases , 2001, VLDB.

[14]  Cyrus Shahabi,et al.  Additively Weighted Voronoi Diagrams for Optimal Sequenced Route Queries , 2006, STDBM.

[15]  Tanzima Hashem,et al.  Group Trip Planning Queries in Spatial Databases , 2013, SSTD.