Bibliography

ABK$^+$06

Elke Achtert, Christian Bohm, Peer Kroger, Peter Kunath, Alexey Pryakhin and Matthias Renz.
Efficient reverse k-nearest neighbor search in arbitrary metric spaces.
In SIGMOD '06: Proceedings of the 2006 ACM SIGMOD international conference on Management of data, Seiten 515-526, New York, NY, USA, 2006. ACM Press.

AM93

Arya and Mount.
Approximate Nearest Neighbor Queries in Fixed Dimensions.
In SODA: ACM-SIAM Symposium on Discrete Algorithms (A Conference on Theoretical and Experimental Analysis of Discrete Algorithms), 1993.

AMN$^+$98

Sunil Arya, David M. Mount, Nathan S. Netanyahu, Ruth Silverman and Angela Y. Wu.
An optimal algorithm for approximate nearest neighbor searching fixed dimensions.
Journal of the ACM, 45(6):891-923, 1998.

Ben75

Jon Louis Bentley.
Multidimensional binary search trees used for associative searching.
Commun. ACM, 18(9):509-517, 1975.

Ber93

Marshall Bern.
Approximate closest-point queries in high dimensions.
Inf. Process. Lett., 45(2):95-99, 1993.

Bia69

T. Bially.
Space-Filling Curves: Their Generation and Their Application to Bandwidth Reduction.
IEEE Transactions on Information Theory, 15(6):658-664, 1969.

BJKS02

R. Benetis, C. Jensen, G. Karciauskas and S. Saltenis.
Nearest Neighbor and Reverse Nearest Neighbor Queries for Moving Objects, 2002.

BK04

Christian Böhm and Florian Krebs.
The k-Nearest Neighbour Join: Turbo Charging the KDD Process.
Knowl. Inf. Syst., 6(6):728-749, 2004.

BKS93

Thomas Brinkhoff, Hans-Peter Kriegel and Bernhard Seeger.
Efficient processing of spatial joins using R-trees.
In SIGMOD '93: Proceedings of the 1993 ACM SIGMOD international conference on Management of data, Seiten 237-246, New York, NY, USA, 1993. ACM Press.

BKSS90

Norbert Beckmann, Hans-Peter Kriegel, Ralf Schneider and Bernhard Seeger.
The R*-tree: an efficient and robust access method for points and rectangles.
In SIGMOD '90: Proceedings of the 1990 ACM SIGMOD international conference on Management of data, Seiten 322-331, New York, NY, USA, 1990. ACM Press.

BM72

Rudolf Bayer and Edward M. McCreight.
Organization and Maintenance of Large Ordered Indices.
Acta Inf., 1:173-189, 1972.

CC05

Hyung-Ju Cho and Chin-Wan Chung.
An efficient and scalable approach to CNN queries in a road network.
In VLDB '05: Proceedings of the 31st international conference on Very large data bases, Seiten 865-876. VLDB Endowment, 2005.

CG99

Surajit Chaudhuri and Luis Gravano.
Evaluating Top-k Selection Queries.
In VLDB'99, Seiten 397-410, 1999.

CHC04

Y. Cai, K. Hua and G. Cao.
Processing Range-Monitoring Queries on Heterogeneous Mobile Objects, 2004.

CMTV00

Antonio Corral, Yannis Manolopoulos, Yannis Theodoridis and Michael Vassilakopoulos.
Closest pair queries in spatial databases.
In Proceedings 1994 ACM SIGMOD Conference, Dallas, TX, Seiten 189-200, 2000.

CMTV04

A. Corral, Y. Manolopoulos, Y. Theodoridis and M. Vassilakopoulos.
Algorithms for Processing K-closest-pair Queries in Spatial Databases, 2004.

CP07

Yun Chen and Jignesh M. Patel.
Efficient Evaluation of All-Nearest-Neighbor Queries. To appear in ICDE, 2007.

CYL07

Muhammad Aamir Cheema, Yidong Yuan and Xuemin Lin.
CircularTrip: An Effective Algorithm for Continuous kNN Queries. To appear in the 12th International Conference on Database Sytems for Advanced Applications (DASFAA), 2007.

FNPS79

Ronald Fagin, Jurg Nievergelt, Nicholas Pippenger and H. Raymond Strong.
Extendible hashing- a fast access method for dynamic files.
ACM Trans. Database Syst., 4(3):315-344, 1979.

FSAA01

Hakan Ferhatosmanoglu, Ioanna Stanoi, Divyakant Agrawal and Amr El Abbadi.
Constrained Nearest Neighbor Queries.
Lecture Notes in Computer Science, 2121:257-??, 2001.

GG98

Volker Gaede and Oliver Günther.
Multidimensional access methods.
ACM Computing Surveys, 30(2):170-231, 1998.

GL04

B. Gedik and L. Liu.
MobiEyes: Distributed Processing of Continuously Moving Queries on Moving Objects in a Mobile System, 2004.

Gut84

Antonin Guttman.
R-trees: a dynamic index structure for spatial searching.
In SIGMOD '84: Proceedings of the 1984 ACM SIGMOD international conference on Management of data, Seiten 47-57, New York, NY, USA, 1984. ACM Press.

Gut94

Ralf Hartmut Guting.
An introduction to spatial database systems.
The VLDB Journal, 3(4):357-399, 1994.

Hen94

Andreas Henrich.
A Distance Scan Algorithm for Spatial Access Structures.
In ACM-GIS, Seiten 136-143, 1994.

HLX06

Haibo Hu, Dik Lun Lee and Jianliang Xu.
Fast Nearest Neighbor Search on Road Networks.
In EDBT, Seiten 186-203, 2006.

Hon04

Chenyi Xia Hongjun.
GORDER: An Efficient Method for KNN Join Processing, 2004.

HS98

Gísli R. Hjaltason and Hanan Samet.
Incremental distance join algorithms for spatial databases.
Seiten 237-248, 1998.

HS99

Gísli R. Hjaltason and Hanan Samet.
Distance browsing in spatial databases.
ACM Transactions on Database Systems, 24(2):265-318, 1999.

HXL05

Haibo Hu, Jianliang Xu and Dik Lun Lee.
A Generic Framework for Monitoring Continuous Spatial Queries over Moving Objects.
In SIGMOD, Seiten 479-490, 2005.

ISS03

Glenn S. Iwerks, Hanan Samet and Kenneth P. Smith.
Continuous K-Nearest Neighbor Queries for Continuously Moving Points with Updates.
In VLDB, Seiten 512-523, 2003.

JKPT03

Christian S. Jensen, Jan Kolarvr, Torben Bach Pedersen and Igor Timko.
Nearest neighbor queries in road networks.
In GIS '03: Proceedings of the 11th ACM international symposium on Advances in geographic information systems, Seiten 1-8, New York, NY, USA, 2003. ACM Press.

KGT99

George Kollios, Dimitrios Gunopulos and Vassilis J. Tsotras.
Nearest Neighbor Queries in a Mobile Environment.
In Spatio-Temporal Database Management, Seiten 119-134, 1999.

KM00

Flip Korn and S. Muthukrishnan.
Influence sets based on reverse nearest neighbor queries.
Seiten 201-212, 2000.

KMS$^+$07

James Kang, Mohamed Mokbel, Shashi Shekhar, Tian Xia and Donghui Zhang.
Continuous Evaluation of Monochromatic and Bichromatic Reverse Nearest Neighbors. To appear in ICDE, 2007.

KOR98

Eyal Kushilevitz, Rafail Ostrovsky and Yuval Rabani.
Efficient search for approximate nearest neighbor in high dimensional spaces.
Seiten 614-623, 1998.

KOTZ04

N. Koudas, B. Ooi, K. Tan and R. Zhang.
Approximate NN queries on streams with guaranteed error /performance bounds, 2004.

KPH04

Dmitri V. Kalashnikov, Sunil Prabhakar and Susanne E. Hambrusch.
Main Memory Evaluation of Monitoring Queries Over Moving Objects.
Distrib. Parallel Databases, 15(2):117-135, 2004.

KS97

Norio Katayama and Shin'ichi Satoh.
The SR-tree: an index structure for high-dimensional nearest neighbor queries.
Seiten 369-380, 1997.

KS04a

Mohammad Kolahdouzan and Cyrus Shahabi.
Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases, 2004.

KS04b

Mohammad R. Kolahdouzan and Cyrus Shahabi.
Continuous K-Nearest Neighbor Queries in Spatial Network Databases.
In STDBM, Seiten 33-40, 2004.

KSF$^+$96

Flip Korn, Nikolaos Sidiropoulos, Christos Faloutsos, Eliot Siegel and Zenon Protopapas.
Fast Nearest Neighbor Search in Medical Image Databases.
In The VLDB Journal, Seiten 215-226, 1996.

LCGMW02

C. Li, E. Chang, H. Garcia-Molina and G. Wiederhold.
Clustering for approximate similarity search in high-dimensional spaces, 2002.

LHJ$^+$03

M. Lee, W. Hsu, C. Jensen, B. Cui and K. Teo.
Supporting frequent updates in R-Trees: A bottom-up approach, 2003.

LLHH05

Hongga Li, Hua Lu, Bo Huang and Zhiyong Huang.
Two ellipse-based pruning methods for group nearest neighbor queries.
In GIS '05: Proceedings of the 13th annual ACM international workshop on Geographic information systems, Seiten 192-199, New York, NY, USA, 2005. ACM Press.

LLL06

Ken C. K. Lee, Wang-Chien Lee and Hong Va Leong.
Nearest Surrounder Queries.
In ICDE '06: Proceedings of the 22nd International Conference on Data Engineering (ICDE'06), Seite 85, Washington, DC, USA, 2006. IEEE Computer Society.

LNY03

King-Ip Lin, Michael Nolen and Congjun Yang.
Applying Bulk Insertion Techniques for Dynamic Reverse Nearest Neighbor Problems.
ideas, 00:290, 2003.

MHP05

Kyriakos Mouratidis, Marios Hadjieleftheriou and Dimitris Papadias.
Conceptual Partitioning: An Efficient Method for Continuous Nearest Neighbor Monitoring.
In SIGMOD, Seiten 634-645, 2005.

MPBT05

Kyriakos Mouratidis, Dimitris Papadias, Spiridon Bakiras and Yufei Tao.
A Threshold-Based Algorithm for Continuous Monitoring of k Nearest Neighbors.
IEEE Transactions on Knowledge and Data Engineering, 17(11):1451-1464, 2005.

MYPM06

Kyriakos Mouratidis, Man Lung Yiu, Dimitris Papadias and Nikos Mamoulis.
Continuous nearest neighbor monitoring in road networks.
In VLDB'2006: Proceedings of the 32nd international conference on Very large data bases, Seiten 43-54. VLDB Endowment, 2006.

MZ02

J. Maheshwari and N. Zeh.
On reverse nearest neighbor queries, 2002.

NHS84

J. Nievergelt, Hans Hinterberger and Kenneth C. Sevcik.
The Grid File: An Adaptable, Symmetric Multikey File Structure.
ACM Trans. Database Syst., 9(1):38-71, 1984.

NO97

K. Nakano and S. Olariu.
An Optimal Algorithm for the Angle-Restricted All Nearest Neighbor Problem on the Reconfigurable Mesh, with Applications:.
IEEE Transactions on Parallel and Distributed Systems, 8(9):983-990, 1997.

PM97

Apostolos Papadopoulos and Yannis Manolopoulos.
Performance of Nearest Neighbor Queries in R-Trees.
In ICDT '97: Proceedings of the 6th International Conference on Database Theory, Seiten 394-408, London, UK, 1997. Springer-Verlag.

PSTM04

Dimitris Papadias, Qiongmao Shen, Yufei Tao and Kyriakos Mouratidis.
Group Nearest Neighbor Queries.
In ICDE '04: Proceedings of the 20th International Conference on Data Engineering, Seite 301, Washington, DC, USA, 2004. IEEE Computer Society.

PXK$^+$02

S. Prabhakar, Y. Xia, D. Kalashnikov, Walid G. Aref and S. Hambrusch.
Query Indexing and Velocity Constrained Indexing: Scalable Techniques For Continuous Queries on Moving Objects, 2002.

PZMT03

D. Papadias, J. Zhang, N. Mamoulis and Y. Tao.
Query Processing in Spatial Network Databases, 2003.

RKV95

Nick Roussopoulos, Stephen Kelley and Frédéric Vincent.
Nearest neighbor queries.
Seiten 71-79, 1995.

RPM03

K. Raptopoulou, A. N. Papadopoulos and Y. Manolopoulos.
Fast Nearest-Neighbor Query Processing in Moving-Object Databases.
Geoinformatica, 7(2):113-137, 2003.

SAA00

Ioana Stanoi, Divyakant Agrawal and Amr El Abbadi.
Reverse Nearest Neighbor Queries for Dynamic Databases.
In ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, Seiten 44-53, 2000.

SFT03

A. Singh, H. Ferhatosmanoglu and A. Tosun.
High Dimensional Reverse Nearest Neighbor Queries, 2003.

SJLL00

Simonas Saltenis, Christian S. Jensen, Scott T. Leutenegger and Mario A. Lopez.
Indexing the Positions of Continuously Moving Objects.
In SIGMOD Conference, Seiten 331-342, 2000.

SK98

Thomas Seidl and Hans-Peter Kriegel.
Optimal Multi-Step k-Nearest Neighbor Search.
In SIGMOD Conference, Seiten 154-165, 1998.

SKS02

Cyrus Shahabi, Mohammad R. Kolahdouzan and Mehdi Sharifzadeh.
A road network embedding technique for k-nearest neighbor search in moving object databases.
In ACM-GIS, Seiten 94-10, 2002.

SR01

Zhexuan Song and Nick Roussopoulos.
K-Nearest Neighbor Search for Moving Query Point.
In SSTD '01: Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases, Seiten 79-96, London, UK, 2001. Springer-Verlag.

SRAA01

Ioana Stanoi, Mirek Riedewald, Divyakant Agrawal and Amr El Abbadi.
Discovery of Influence Sets in Frequently Updated Databases.
In The VLDB Journal, Seiten 99-108, 2001.

SSH86

Michael Stonebraker, Timos K. Sellis and Eric N. Hanson.
An Analysis of Rule Indexing Implementations in Data Base Systems.
In Expert Database Conf., Seiten 465-476, 1986.

SWCD97

A. Prasad Sistla, Ouri Wolfson, Sam Chamberlain and Son Dao.
Modeling and Querying Moving Objects.
In ICDE, Seiten 422-432, 1997.

TFPL04

Yufei Tao, Christos Faloutsos, Dimitris Papadias and Bin Liu.
Prediction and indexing of moving objects with unknown motion patterns.
In SIGMOD '04: Proceedings of the 2004 ACM SIGMOD international conference on Management of data, Seiten 611-622, New York, NY, USA, 2004. ACM Press.

TP02

Yufei Tao and Dimitris Papadias.
Time-Parameterized Queries in Spatio-Temporal Databases.
In SIGMOD Conference, 2002.

TPL04

Yufei Tao, Dimitris Papadias and Xiang Lian.
Reverse kNN Search in Arbitrary Dimensionality.
In VLDB, Seiten 744-755, 2004.

TPS02

Yufei Tao, Dimitris Papadias and Qiongmao Shen.
Continuous Nearest Neighbor Search.
In VLDB, Seiten 287-298, 2002.

TPS03

Yufei Tao, Dimitris Papadias and Jimeng Sun.
The TPR*-Tree: An Optimized Spatio-Temporal Access Method for Predictive Queries, 2003.

TYM06

Yufei Tao, Man Lung Yiu and Nikos Mamoulis.
Reverse Nearest Neighbor Search in Metric Spaces.
IEEE Transactions on Knowledge and Data Engineering, 18(9):1239-1252, 2006.

XMA$^+$04

Xiaopeng Xiong, Mohamed F. Mokbel, Walid G. Aref, Susanne E. Hambrusch and Sunil Prabhakar.
Scalable Spatio-temporal Continuous Query Processing for Location-Aware Services, 2004.

XMA05

Xiaopeng Xiong, Mohamed F. Mokbel and Walid G. Aref.
SEA-CNN: Scalable Processing of Continuous K-Nearest Neighbor Queries in Spatio-temporal Databases.
In ICDE, Seiten 643-654, 2005.

XZ06

Tian Xia and Donghui Zhang.
Continuous Reverse Nearest Neighbor Monitoring.
In ICDE '06: Proceedings of the 22nd International Conference on Data Engineering (ICDE'06), Seite 77, Washington, DC, USA, 2006. IEEE Computer Society.

XZKD05

Tian Xia, Donghui Zhang, Evangelos Kanoulas and Yang Du.
On computing top-t most influential spatial sites.
In VLDB '05: Proceedings of the 31st international conference on Very large data bases, Seiten 946-957. VLDB Endowment, 2005.

YL01

Congjun Yang and King-Ip Lin.
An Index Structure for Efficient Reverse Nearest Neighbor Queries.
In Proceedings of the 17th International Conference on Data Engineering, Seiten 485-492, Washington, DC, USA, 2001. IEEE Computer Society.

YMP05

Man Lung Yiu, Nikos Mamoulis and Dimitris Papadias.
Aggregate Nearest Neighbor Queries in Road Networks.
IEEE Transactions on Knowledge and Data Engineering, 17(6):820-833, 2005.

YPK05

Xiaohui Yu, Ken Q. Pu and Nick Koudas.
Monitoring K-Nearest Neighbor Queries Over Moving Objects.
In ICDE, Seiten 631-642, 2005.

YPMT05

Man Lung Yiu, Dimitris Papadias, Nikos Mamoulis and Yufei Tao.
Reverse Nearest Neighbors in Large Graphs.
In ICDE '05: Proceedings of the 21st International Conference on Data Engineering (ICDE'05), Seiten 186-187, Washington, DC, USA, 2005. IEEE Computer Society.

ZPMT04

Jun Zhang, Dimitris Papdias, Nikos Mamoulis and Yufei Tao.
All-Nearest-Neighbors Queries in Spatial Databases.
In SSDBM '04: Proceedings of the 16th International Conference on Scientific and Statistical Database Management (SSDBM'04), Seite 297, Washington, DC, USA, 2004. IEEE Computer Society.

ZZP$^+$03

J. Zhang, M. Zhu, D. Papadias, Y. Tao and D. Lee.
Location-based spatial queries, 2003.