A. Abulnaga and J.F. Naughton: ``Accurate Estimation of the Cost of Spatial Selections", Proceedings 16th IEEE International Conference on Data Engineering (ICDE'00), pp.123-134, San Diego, CA, 2000.

S. Acharya, V. Poosala and S. Ramaswamy: ``Selectivity Estimation in Spatial Databases", Proceedings ACM SIGMOD Conference on Management of Data, pp.13-24, Philadelphia, PA, 1999.

D.W. Adler: ``IBM DB2 Spatial Extender - Spatial Data within the DBMS", Proceedings 27th International Conference on Very Large Data Bases (VLDB'01), pp.687-690, Rome, Italy, 2001.

P.K. Agarwal, M. deBerg, J. Gudmundsson, M. Hammar and H.J. Haverkort: ``Box-trees and R-trees with Near Optimal Query Time", Proceedings Symposium on Computational Geometry, pp.124-133, Medford, MA, 2001.

C. Aggarwal, J. Wolf, P. Wu and M. Epelman: ``The S-tree - an Efficient Index for Multidimensional Objects", Proceedings 5th International Symposium on Spatial Databases (SSD'97), pp.350-373, Berlin, Germany, 1997.

R. Agrawal, C. Faloutsos and A. Swami. ``Efficient Similarity Search in Sequence Databases", Proceedings 4th International Conference of Foundations of Data Organization and Algorithms (FODO'93), pp.69-84, Chicago, IL, 1993.

V.T. Almeida and R.H. Guting: ``Indexing the Trajectories of Moving Objects in Networks", Proceedings 16th International Conference on Scientific and Statistical Database Management (SSDBM'04), pp.115-118, Santorini Island, Greece, 2004.

N. An, J. Jin and A. Sivasubramaniam: ``Toward an Accurate Analysis of Range Queries on Spatial Data", IEEE Transactions on Knowledge and Data Engineering, Vol.15, No.2, pp,305-323, 2003.

N. An, L. Qian, A. Sivasubramaniam and T. Keefe: ``Evaluating Parallel R-tree Implementations on a Network of Workstations", Proceedings 6th ACM International Symposium on Advances in Geographic Information Systems (GIS'98), pp.159-160, Washington, DC, 1998.

N. An, Z.-Y. Yang and A. Sivasubramanian: ``Selectivity Estimation for Spatial Joins", Proceedings 17th IEEE International Conference on Data Engineering (ICDE'01), pp.368-375, Heidelberg, Germany, 2001.

C.H. Ang and T.C. Tan: ``New Linear Node Splitting Algorithm for R-trees", Proceedings 5th International Symposium on Spatial Databases (SSD'97), pp.339-349, Berlin, Germany, 1997.

C.H. Ang and T.C. Tan: ``Bitmap R-trees", Informatica, Vol.24, No.2, 2000.

W.G. Aref and H. Samet: ``A Cost Model for Query Optimization Using R-trees", Proceedings 2nd ACM International Symposium on Advances in Geographic Information Systems (GIS'94), Gaithersburg, MD, 1994.

L. Arge: ``The Buffer Tree: a New Technique for Optimal I/O Algorithms'', Proceedings 4th International Workshop on Algorithms and Data Structures (WADS'95), pp.334-345, Kingston, Canada, 1995.

L. Arge, M. deBerg, H.J. Haverkort and K. Yi: ``The Priority R-Tree: a Practically Efficient and Worst-Case Optimal R-Tree", Proceedings ACM SIGMOD Conference on Management of Data, pp.347-358, Paris, France, 2004.

L. Arge, K. Hinrichs, J. Vahrenhold and J.S. Vitter: ``Efficient Bulk Operations on Dynamic R-trees", Algorithmica, Vol.33, No.1, pp.104-128, 2002.

L. Arge, O. Procopiuc, S. Ramaswamy, T. Suel, J. Vahrenhold and J.S. Vitter: ``A Unified Approach for Indexed and Non-Indexed Spatial Joins", Proceedings 8th International Conference on Extending Database Technology (EDBT'00), pp.413-429, Konstanz, Germany, 2000.

B. Becker, S. Gschwind, T. Ohler, B. Seeger and P. Widmayer: ``An Asymptotically Optimal Multi-Version B-tree", The VLDB Journal, Vol.5, No.4, pp.264-275, 1996.

N. Beckmann, H.P. Kriegel, R. Schneider and B. Seeger: ``The R$^*$-tree: an Efficient and Robust Method for Points and Rectangles", Proceedings ACM SIGMOD Conference on Management of Data, pp.322-331, Atlantic City, NJ, 1990.

A. Belussi and C. Faloutsos: ``Estimating the Selectivity of Spatial Queries Using the `Correlation' Fractal Dimension", Proceedings 21st International Conference on Very Large Data Bases (VLDB'95), pp.299-310, Zurich, Switzerland, 1995.

A. Belussi and C. Faloutsos: ``Self-Spatial Join Selectivity Estimation Using Fractal Concepts", ACM Transactions on Information Systems, Vol.16, No.2, pp.161-201, 1998.

S. Berchtold, C. Boehm, D.A. Keim and H.-P. Kriegel. ``A Cost Model for Nearest Neighbor Search in High-Dimensional Data Space", Proceedings 16th ACM Symposium on Principles of Database Systems (PODS'97), pp.78-86, Tucson, AZ, 1997.

S. Berchtold, C. Boehm, D.A. Keim, F. Krebs and H.P. Kriegel: ``On Optimizing Nearest Neighbor Queries in High-Dimensional Data Spaces'', Proceedings 8th International Conference on Database Theory (ICDT'01), pp.435-449, London, UK, 2001.

S. Berchtold, D.A. Keim and H.P. Kriegel: ``The X-tree - an Index Structure for High-Dimensional Data", Proceedings 22nd International Conference on Very Large Data Bases (VLDB'96), pp.28-39, Bombay, India, 1996.

E. Bertino, B. Catania and L. Chiesa: ``Definition and Analysis of Index Organizations for Object-oriented Database Systems", Information Systems, Vol.23, No.2, pp.65-108, 1998.

A.K. Bhide, A. Dan and D.M. Dias: ``A Simple Analysis of the LRU Buffer Policy and its Relationship to Buffer Warm-up Transient'', Proceedings 9th IEEE International Conference on Data Engineering (ICDE'93), pp.125-133, Vienna, Austria, 1993.

R. Bliujute, C.S. Jensen, S. Saltenis and G. Slivinskas: ``R-tree Based Indexing of Now-Relative Bitemporal Data", Proceedings 24th International Conference on Very Large Data Bases (VLDB'98), pp.345-356, New York, NY, 1998.

R. Bliujute, C.S. Jensen, S. Saltenis and G. Slivinskas: ``Light-Weight Indexing of Bitemporal Data", Proceedings 12th International Conference on Scientific and Statistical Database Management (SSDBM'00), pp.125-138, Berlin, Germany, 2000.

C.A. Boehm: ``A Cost Model for Query Processing in High-Dimensional Spaces", ACM Transactions on Database Systems, Vol.25, No.2, pp.129-178, 2000.

C. Bohm and H.P. Kriegel: ``A Cost Model and Index Architecture for the Similarity Join", Proceedings 17th IEEE International Conference on Data Engineering (ICDE'01), pp. 411-420. Heidelberg, Kriegel, 2001.

P. Bozanis, A. Nanopoulos and Y. Manolopoulos: ``LR-tree - a Logarithmic Decomposable Spatial Index Method", The Computer Journal, Vol.46, No.3, pp.319-331, 2003.

S. Brakatsoulas, D. Pfoser and Y. Theodoridis: ``Revisiting R-tree Construction Principles", Proceedings 6th East European Conference on Advances in Databases and Information Systems (ADBIS'02), pp.149-162, Bratislava, Slovakia, 2002.

T. Brinkhoff, H. Horn, H.-P. Kriegel and R. Schneider. ``A Storage and Access Architecture for Efficient Query Processing in Spatial Database Systems", Proceedings 3rd International Symposium on Spatial Databases (SSD'93), pp.357-376, Singapore, 1993.

T. Brinkhoff, H.-P. Kriegel, R. Schneider and B. Seeger. ``Multi-Step Processing of Spatial Joins", Proceedings ACM SIGMOD Conference on Management of Data, pp.197-208, Minneapolis, MN, 1994.

T. Brinkhoff, H.-P. Kriegel and B. Seeger: ``Efficient Processing of Spatial Joins Using R-trees", Proceedings ACM SIGMOD Conference on Management of Data, pp.237-246, Washington, DC, 1993.

T. Brinkhoff, H.-P.Kriegel and B. Seeger: ``Parallel Processing of Spatial Joins Using R-trees", Proceedings 12th IEEE International Conference on Data Engineering (ICDE'96), pp.258-265, New Orleans, LA, 1996.

M.J. Carey, D.J. DeWitt, M.J. Franklin, N.E. Hall, M.L. McAuliffe, J.F. Naughton, D.T. Schuh, M.H. Solomon, C.K. Tan, O.G. Tsatalos, S.J. White and M.J. Zwilling: ``Shoring Up Persistent Applications", Proceedings ACM SIGMOD Conference on Management of Data, pp.383-394, Minneapolis, MN, 1994.

V.P. Chakka, A. Everspaugh and J. Patel: ``Indexing Large Trajectory Data Sets with SETI", Proceedings 1st Biennial Conference on Innovative Data Systems Research (CIDR'03), Asilomar, CA, 2003.

K. Chakrabarti and S. Mehrotra: ``Dynamic Granular Locking Approach to Phantom Protection in R-trees", Proceedings 14th IEEE International Conference on Data Engineering (ICDE'98), pp.446-454, Orlando, FL, 1998.

E.P.F. Chan: ``Buffer Queries", IEEE Transactions on Knowledge and Data Engineering, Vol.15, No.4, pp.895-910, 2003.

J.K. Chen, Y.F. Huang and Y.H. Chin: ``A Study of Concurrent Operations on R-trees", Information Sciences, Vol.98, No.1-4, pp.263-300, 1997.

L. Chen, R. Choubey and E.A. Rundensteiner: ``Bulk-Insertions into R-trees Using the Small-Tree-Large-Tree Approach", Proceedings 6th ACM International Symposium on Advances in Geographic Information Systems (GIS'98), pp.161-162, Washington, DC, 1998.

P.M. Chen, E.K. Lee, G.A. Gibson, R.H. Katz and D.A. Patterson: ``RAID, High-Performance, Reliable Secondary Storage", ACM Computing Surveys, Vol.26, No.2, pp.145-185, 1994.

S. Chen and D. Towsley: ``A Performance Evaluation of RAID Architectures", IEEE Transactions on Computers, Vol.45, No.10, pp.1116-1130, 1996.

K.L. Cheung and A. Fu: ``Enhanced Nearest Neighbor Search on the R-tree", ACM SIGMOD Record, Vol.27, No.3, pp.16-21, 1998.

Y. Choi, and C. Chung: ``Selectivity Estimation for Spatio-Temporal Queries to Moving Objects", Proceedings ACM SIGMOD Conference on Management of Data, pp.440-451, Madison, WI, 2002.

R. Choubey, L. Chen and E. Rundensteiner: ``GBI - a Generalized R-tree Bulk-Insertion Strategy", Proceedings 6th International Symposium on Spatial Databases (SSD'99), pp.91-108, Hong-Kong, China, 1999.

J. Clifford, C.E. Dyresom, T. Isakowitz, C.S. Jensen and R.T. Snodgrass: ``On the Semantics of `now'", ACM Transactions on Database Systems, Vol.22, No.2, pp.171-214, 1997.

D. Comer: ``The Ubiquitous B-tree", ACM Computing Surveys, Vol.11, No.2, pp.121-137, 1979.

A. Corral, Y. Manolopoulos, Y. Theodoridis and M. Vassilakopoulos: ``Closest Pair Queries in Spatial Databases", Proceedings ACM SIGMOD Conference on Management of Data, pp.189-200, Dallas, TX, 2000.

A. Corral, Y. Manolopoulos, Y. Theodoridis and M. Vassilakopoulos: ``Multi-way Distance Join Queries in Spatial Databases", GeoInformatica, Vol.8, No.4, pp.373-402, 2004.

A. Corral, Y. Manolopoulos, Y. Theodoridis and M. Vassilakopoulos: ``Cost Models for Distance Join Queries Using R-trees", accepted, 2005.

A. Corral and M. Vassilakopoulos: ``An Approximate Algorithms for Distance-Based Queries Using R-Trees”, The Computer Journal, Vol.48, No.2, pp.220-238, 2005.

A. Corral, M. Vassilakopoulos and Y. Manolopoulos. ``Algorithms for Joining R-Trees and Linear Region Quadtrees", Proceedings 6th International Symposium on Spatial Databases (SSD'99), pp.251-269, Hong-Kong, China, 1999.

A. Corral, M. Vassilakopoulos and Y. Manolopoulos: ``The Impact of Buffering on Closest Pairs Queries Using R-trees", Proceedings 5th East European Conference on Advances in Databases and Information Systems (ADBIS'01), pp.41-54, Vilnius, Lithuania, 2001.

M. deBerg, M. Hammar, M.H. Overmars and J. Gudmundsson: ``On R-trees with Low Stabbing Number", Computational Geometry - Theory and Applications, Vol.24, No.3, pp.179-195, 2002.

D. DeWitt and J. Gray: ``Parallel Database Systems, the Future of High Performance Database Systems", Communications of the ACM, Vol.35, No.6, pp.85-98, 1992.

D.J. DeWitt, N. Kabra, J. Luo, J.M. Patel and J.-B. Yu: ``Client-Server Paradise", Proceedings 20th International Conference on Very Large Data Bases (VLDB'94), pp.558-569, Santiago, Chile, 1994.

EzSoft Engineering Website: http://www.ezgis.com

C. Faloutsos, Searching Multimedia Databases by Content, Kluwer Academic Press, 1996.

C. Faloutsos, R. Barber, M. Flickner, J. Hafner, W. Niblack, D. Petkovic and W. Equitz. ``Efficient and Effective Querying by Image Content". Journal of Intelligent Information Systems, Vol.3, No.3/4, 231-262, 1994.

C. Faloutsos and I. Kamel: ``Beyond Uniformity and Independence: Analysis of R-trees Using the Concept of Fractal Dimension", Proceedings 13th ACM Symposium on Principles of Database Systems (PODS'94), pp.4-13, Minneapolis, MN, 1994.

C. Faloutsos, M. Ranganathan and Y. Manolopoulos. ``Fast Subsequence Matching in Time-Series Databases". Proceedings ACM SIGMOD Conference on Management of Data, pp.419-429, Minneapolis, MN, 1994.

C. Faloutsos, B. Seeger, A. Traina and C. Traina: ``Spatial Join Selectivity Using Power Law", Proceedings ACM SIGMOD Conference on Management of Data, pp.177-188, Dallas, TX, 2000.

C. Faloutsos, T. Sellis and N. Roussopoulos: ``Analysis of Object-Oriented Spatial Access Methods", Proceedings ACM SIGMOD Conference on Management of Data, pp.426-439, San Francisco, CA, 1987.

H. Ferhatosmanoglu, I. Stanoi, D. Agrawal and A. Abbadi: ``Constrained Nearest Neighbor Queries", Proceedings 7th International Symposium on Spatial and Temporal Databases (SSTD'01), pp.257-278, Redondo Beach, CA, 2001.

E. Frentzos: ``Indexing Objects Moving on Fixed Networks", Proceedings 8th International Symposium on Spatial and Temporal Databases (SSTD'03), pp.289-305, Santorini Island, Greece, 2003.

X. Fu, D. Wang and W. Zheng: ``GPR-tree, a Global Parallel Index Structure for Multiattribute Declustering on Cluster of Workstations", Proceedings Conference on Advances in parallel and Distributed Computing (APDC'97), pp.300-306, Shanghai, China, 1997.

V. Gaede and O. Guenther: ``Multidimensional Access Methods", ACM Computing Surveys, Vol.30, No.2, pp.170-231, 1998.

Y. Garcia, M. Lopez and S. Leutenegger: ``A Greedy Algorithm for Bulk Loading R-trees", Proceedings 6th ACM International Symposium on Advances in Geographic Information Systems (GIS'98), pp.163-164, Washington, DC, 1998.

Y. Garcia, M. Lopez and S. Leutenegger: ``On Optimal Node Splitting for R-trees", Proceedings 24th International Conference on Very Large Data Bases (VLDB'98), pp.334-344, New York, NY, 1998.

Y. Garcia, M. Lopez and S. Leutenegger: ``Post-Optimization and Incremental Refinement of R-trees", Proceedings 7th ACM International Symposium on Advances in Geographic Information Systems (GIS'99), pp.91-96, Kansas City, MO, 1999.

M. Gorawski and R. Malczok: ``Aggregation and Analysis of Spatial Data by Means of Materialized Aggregation Tree", Proceedings 3rd International Conference on Advances in Information Systems (ADVIS'04), pp.24-33, Izmir, Turkey, 2004.

M. Gorawski and R. Malczok: ``Distributed Spatial Data Warehouse Indexed with Virtual Memory Aggregation Tree", Proceedings 2nd International Workshop on Spatio-Temporal Database Management (STDBM'04), pp.25-32, Toronto, Canada, 2004

G. Graefe: ``Query Evaluation Techniques for Large Databases", ACM Computing Surveys, Vol.25, No.2, pp.73-170, 1993.

J. Gray, A. Bosworth, A. Layman and H. Pirahesh. ``Data Cube: a Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Totals", Proceedings 12th IEEE International Conference on Data Engineering (ICDE'96), pp.152-159, New Orleans, LA, 1996.

O. Guenther: ``The Cell Tree - an Object Oriented Index Structure for Geometric Databases", Proceedings 5th IEEE International Conference on Data Engineering (ICDE'89), pp.598-605, Los Angeles, CA, 1989.

O. Guenther and V. Gaede: ``Oversize Shelves - a Storage Management Technique for Large Spatial Data Objects", International Journal of Geographical Information Science, Vol.11, No.1, pp.5-32, 1997.

O. Guenther and H. Noltemeier: ``Spatial Database Indices for Large Extended Objects", Proceedings 7th IEEE International Conference on Data Engineering (ICDE'91), pp.520-526, Kobe, Japan, 1991.

C. Gurret, Y. Manolopoulos, A. Papadopoulos and P. Rigaux, ``The BASIS System: a Benchmarking Approach for Spatial Index Structures", Proceedings 1st International Workshop on Spatiotemporal Databases Management (STDBM'99), pp.152-170, Edinburgh, Scotland, 1999.

A. Guttman: ``R-trees: a Dynamic Index Structure for Spatial Searching", Proceedings ACM SIGMOD Conference on Management of Data, pp.47-57, Boston, MA, 1984.

M. Hadjieleftheriou, G. Kollios and V. Tsotras: ``Performance Evaluation of Spatio-Temporal Selectivity Estimation Techniques", Proceedings 15th International Conference on Scientific and Statistical Database Management (SSDBM'03), pp.202-211, Cambridge, MA, 2003.

J. Han, K. Koperski and N. Stefanovic: ``GeoMiner: a System Prototype for Spatial Data Mining", Proceedings ACM SIGMOD Conference on Management of Data, pp.553-556, Tucson, AZ, 1997.

J. Hellerstein, J. Naughton and A. Pfeffer: ``Generalized Search Trees for Database Systems", Proceedings 21st International Conference on Very Large Data Bases (VLDB'95), pp.562-573, Zurich, Switzerland, 1995.

J.M. Hellerstein and A. Pfeffer: ``The RD-tree: an Index Structure for Sets", Technical Report No. 1252, University of California, Berkeley, 1994.

G. Hjaltason and H. Samet. ``Ranking in Spatial Databases", Proceedings 4th International Symposium on Spatial Databases (SSD'95), pp.83-95, Portland, ME, 1995.

G. Hjaltason and H. Samet: ``Incremental Distance Join Algorithms for Spatial Databases", Proceedings ACM SIGMOD Conference on Management of Data, pp.237-248, Seattle, WA, 1998.

G. Hjaltason and H. Samet: ``Distance Browsing in Spatial Databases", ACM Transactions on Database Systems, Vol.24, No.2, pp.265-318, 1999.

E.G. Hoel and H. Samet: ``Performance of Data-Parallel Spatial Operations", Proceedings 20th International Conference on Very Large Data Bases (VLDB'94), pp.156-167, Santiago, Chile, 1994.

E.G. Hoel and H. Samet: ``Benchmarking Spatial Join Operations with Spatial Output", Proceedings 21st International Conference on Very Large Data Bases (VLDB'95), pp.606-618, Zurich, Switzerland, 1995.

Y.-W. Huang, N. Jing and E. Rundensteiner: ``A Cost Model for Estimating the Performance of Spatial Joins Using R-trees", Proceedings 9th International Conference on Scientific and Statistical Database Management (SSDBM'97), pp.30-38, Olympia, WA, 1997.

Y.-W. Huang, N. Jing and E. Rundensteiner. ``Spatial Joins Using R-trees: Breadth-First Traversal with Global Optimizations", Proceedings 23rd International Conference on Very Large Data Bases (VLDB'97), pp.396-405, Athens, Greece, 1997.

P.W. Huang, P.L. Lin and H.Y. Lin: ``Optimizing Storage Utilization in R-tree Dynamic Index Structure for Spatial Databases", Journal of Systems and Software, Vol.55, No.3, pp.291-299, 2001.

Informix Corporation: ``The Informix R-tree Index User's Guide", Informix Press, 2001.

Y. Ioannidis and Y. Kang: ``Randomized Algorithms for Optimizing Large Join Queries", Proceedings ACM SIGMOD Conference on Management of Data, pp.312-321, Atlantic City, NJ, 1990.

H.V. Jagadish: ``Spatial Search with Polyhedra", Proceedings 6th IEEE International Conference on Data Engineering (ICDE'90), pp.311-319, Orlando, FL, 1990.

H.V. Jagadish: ``Analysis of the Hilbert Curve for Representing Two-Dimensional Space", Information Processing Letters, Vol.62, No.1, pp.17-22, 1997.

C.S. Jensen and R. Snodgrass: ``Semantics of Time-Varying Information", Information Systems, Vol.21, No.4, pp.311-352, 1996.

J. Jin, N. An and A. Sivasubramanian: ``Analyzing Range Queries on Spatial Data", Proceedings 16th IEEE International Conference on Data Engineering (ICDE'00), pp.525-534, San Diego, CA, 2000.

H. Jin and H.V. Jagadish: ``Indexing Hidden Markov Models for Music Retrieval", Proceedings 3rd International Symposium on Music Information Retrieval (ISMIR'02), Paris, France, 2002. %+++

T. Johnson and D. Shasha: ``The Performance of Concurrent B-tree Algorithms", ACM Transactions on Database Systems, Vol.18, No.1, pp.51-101, 1993.

M. Juergens and H. Lenz: ``The Ra*-tree - an Improved R-tree with Materialized Data for Supporting Range Queries on OLAP Data", Proceedings 9th International Workshop on Database and Expert Systems Applications (DEXA'98), pp.186-191, Vienna, Austria, 1998.

I. Kamel and C. Faloutsos: ``Parallel R-trees", Proceedings ACM SIGMOD Conference on Management of Data, pp.195-204, San Diego, CA, 1992.

I. Kamel and C. Faloutsos: ``On Packing R-trees", Proceedings 2nd ACM International Conference on Information and Knowledge Management (CIKM'93), pp.490-499, Washington, DC, 1993.

I. Kamel and C. Faloutsos: ``Hilbert R-tree - an Improved R-tree Using Fractals", Proceedings 20th International Conference on Very Large Data Bases (VLDB'94), pp.500-509, Santiago, Chile, 1994.

I. Karydis, A. Nanopoulos, A. Papadopoulos and Y. Manolopoulos: ``Audio Indexing for Efficient Music Information Retrieval". Proceedings 11th International Multimedia Modeling Conference (MMM'05), Melbourne, Australia, 2005.

I. Karydis, A. Nanopoulos, A. Papadopoulos and Y. Manolopoulos: ``Musical Retrieval in P2P Networks under the Warping Distance'', Proceedings 8th International Conference on Enterprise Information Systems (ICEIS'05), Miami, FL, 2005.

N. Katayama and S. Satoh: ``The SR-tree - an Index Structure for High-Dimensional Nearest Neighbor Queries", Proceedings ACM SIGMOD Conference on Management of Data, pp.369-380, Tucson, AZ, 1997.

L. Kaufman and P. Rousseeuw: Finding Groups in Data: an Introduction to Cluster Analysis, Wiley, 1990.

K. Kim, S. Cha and K. Kwon: ``Optimizing Multidimensional Index Trees for Main Memory Access", Proceedings ACM SIGMOD Conference on Management of Data, pp.139-150, Santa Barbara, CA, 2001

D. Knuth: The Art of Computer Programming: Sorting and Searching, Vol.3, Addison-Wesley, 1967.

G. Kollios, D. Gunopoulos and V. Tsotras: ``On Indexing Mobile Objects", Proceedings 18th ACM Symposium on Principles of Database Systems (PODS'99), pp.261-272, Philadelphia, PA, 1999.

G. Kollios, V.J. Tsotras, D. Gunopulos, A. Delis and M. Hadjieleftheriou: ``Indexing Animated Objects Using Spatiotemporal Access Methods", IEEE Transactions on Knowledge and Data Engineering, Vol.13, No.5, pp.758-777, 2001.

K. Koperski and J. Han: ``Discovery of Spatial Association Rules in Geographic Information Databases", Proceedings 4th International Symposium on Spatial Databases (SSD'95), pp.47-66, Portland, ME, 1995.

F. Korn and S. Muthujrishnan: ``Influence Sets Based on Reverse Neighbor Queries", Technical Report, AT\&T Labs Research, 1999.

F. Korn, B.U. Pagel and C. Faloutsos: ``On the `Dimensionality Curse' and the 'Self-Similarity Blessing''', IEEE Transactions on Knowledge and Data Engineering, Vol.13, No.1, pp.96-111, 2001.

F. Korn, N. Sidiropoulos, C. Faloutsos, E. Siegel and Z. Protopapas: ``Fast Nearest Neighbor Search in Medical Image Databases", Proceedings 22nd International Conference on Very Large Databases, pp.215-226, Mumbai, India, 1996.

M. Kornacker: ``High-Performance Extensible Indexing", Proceedings 25th International Conference on Very Large Data Bases (VLDB'99), pp.699-708, Edinburgh, Scotland, 1999.

M. Kornacker and D. Banks: ``High-Concurrency Locking in R-trees", Proceedings 21st International Conference on Very Large Data Bases (VLDB'95), pp.134-145, Zurich, Switzerland, 1995.

R.K.V. Kothuri, S. Ravada and D. Abugov: ``Quadtree and R-tree Indexes in Oracle Spatial: a Comparison Using GIS Data", Proceedings ACM SIGMOD Conference on Management of Data, pp.546-557, Madison, WI, 2002.

R.K.V. Kothuri, A. Godfrind and Beinat: Pro Oracle Spatial: an Essential Guide to Developing Spatially-Enabled Business Applications, Apress, 2004.

Y. Kotidis and N. Roussopoulos, ``An Alternative Storage Organization for ROLAP Aggregate Views Based on Cubetrees", Proceedings ACM SIGMOD Conference on Management of Data, pp.249-258, Seattle, WA, 1998.

N. Koudas, C. Faloutsos and I. Kamel: ``Declustering Spatial Databases on a Multi-computer Architecture", Proceedings 6th International Conference on Extending Database Technology (EDBT'96), pp.592-614, Avignon, France, 1996.

H.-P. Kriegel, P. Kunath, M. Pfeifle, M. Potke, M. Renz and P.-M. Strauss: ``Stochastic Driven Relational R-Tree", Proceedings Brazilian Symposium on Geoinformatics (GEOINFO), Campos do Jordao (SP), Brazil, 2003.

A. Kumar, V.J. Tsotras and C. Faloutsos: ``Designing Access Methods for Bitemporal Databases", IEEE Transactions on Knowledge and Data Engineering, Vol.10, No.1, pp.1-20, 1998.

R. Kurniawati, J.S. Jin and J.A. Shepard: ``SS$^+$-tree: an Improved Index Structure for Similarity Searches in a High-Dimensional Feature Space", Proceedings 5th Conference on Storage and Retrieval for Image and Video Databases (SPIE'97, pp.110-120, San Jose, CA, 1997.

D. Kwon, S.J. Lee and S. Lee: ``Indexing the Current Positions of Moving Objects Using the Lazy Update R-tree", Proceedings 3rd International Conference on Mobile Data Management (MDM'02), pp.113-120, Singapore, 2002.

S. Lai, F. Zhu and Y. Sun: ``A Design of Parallel R-tree on Cluster of Workstations", Proceedings 1st International Workshop Databases in Networked Information Systems (DNIS'00), pp.119-133, Aizu, Japan, 2000.

C. Lang and A. Singh: ``Modeling High Dimensional Index Structures Using Sampling", Proceedings ACM SIGMOD Conference on Management of Data, pp.389-400, Santa Barbara, CA, 2001.

R. Laurini and D. Thomson: Fundamentals of Spatial Information Systems, Academic Press, London, 1992.

T. Lee and S. Lee: ``OMT - Overlap Minimizing Top-down Bulk Loading Algorithm for R-tree", Proceedings of Short Papers at 15th Conference on Advanced Information Systems Engineering (CAiSE'03), Klagenfurt, Austria, 2003.

T. Lee, B. Moon and S. Lee: ``Bulk Insertion for R-tree by Seeded Clustering", Proceedings 14th International Conference on Database and Expert Systems Applications (DEXA'03), pp.129-138, Prague, Czech Republic, 2003.

Y.J. Lee and C.W. Chung: ``The DR-tree - a Main Memory Data Structure for Complex Multidimensional Objects", Geoinformatica, Vol.5, No.2, pp.181-207, 2001.

S. Leutenegger, J.M. Edgington and M.A. Lopez: ``STR - a Simple and Efficient Algorithm for R-tree Packing", Proceedings 13th IEEE International Conference on Data Engineering (ICDE'97), pp.497-506, Birmingham, England, 1997.

S. Leutenegger and M. Lopez: ``A Buffer Model for Evaluating the Performance of R-tree Packing Algorithms", Proceedings ACM International Conference on Measurements and Modeling of Computer Systems (SIGMETRICS), pp.264-265, Philadelphia, PA, 1996.

S. Leutenegger and M. Lopez: ``The Effect of Buffering on the Performance of R-trees", IEEE Transactions on Knowledge and Data Engineering, Vol.12, No.1, pp.33-44, 2000.

S. Leutenegger, R. Sheykhet and M. Lopez: ``A Mechanism to Detect Changing Access Patterns and Automatically Migrate Distributed R-tree Indexed Multidimensional Data", Proceedings 8th ACM International Symposium on Advances in Geographic Information Systems (GIS'00), pp.147-152, Washington, DC, 2000.

K.-I. Lin, H. V. Jagadish and C. Faloutsos: ``The TV-Tree: an Index Structure for High-Dimensional Data", The VLDB Journal, Vol.3, No.4, pp.517-542, 1994.

M.-L. Lo and C. Ravishankar: ``Spatial Joins Using Seeded Trees", Proceedings ACM SIGMOD Conference on Management of Data, pp.209-220, Minneapolis, MN, 1994.

M.-L. Lo and C.V. Ravishankar: ``Spatial Hash-Joins", Proceedings ACM SIGMOD Conference on Management of Data, pp.247-258, Montreal, Canada, 1996.

G. Lu: `` Multimedia Database Management Systems'', Artech House, 1999.

N. Mamoulis and D. Papadias: ``Integration of Spatial Join Algorithms for Processing Multiple Inputs", Proceedings ACM SIGMOD Conference on Management of Data, pp.1-12, Philadelphia, PA, 1999.

N. Mamoulis and D. Papadias: ``Selectivity Estimation of Complex Spatial Queries", Proceedings 7th International Symposium on Spatial and Temporal Databases (SSTD'01), pp.155-174, Redondo Beach, CA, 2001.

N. Mamoulis and D. Papadias: ``Multiway Spatial Joins", ACM Transactions on Database Systems, Vol.26, No.4, pp.424-475, 2001.

N. Mamoulis and D. Papadias: ``Slot Index Spatial Join", IEEE Transactions on Knowledge and Data Engineering, Vol.15, No.1, pp.211-231, 2003.

Y. Manolopoulos, E. Nardelli, A. N. Papadopoulos, and G. Proietti: ``QR-tree: a Hybrid Spatial Data Structure'', Proceedings 1st International Conference on Geographic Information Systems in Urban, Regional and Environmental Planning, pp.247-262, Samos Island, Greece, 1996.

Y. Manolopoulos, Y. Theodoridis and V. Tsotras: `` Advanced Database Indexing'', Kluwer Academic Publishers, 1999.

Mapinfo Website: http://www.mapinfo.com

M. Martynov. ``Spatial Joins and R-trees", Proceedings 2nd International Workshop on Advances in Databases and Information Systems (ADBIS'95), pp.295-304, Moscow, Russia, 1995.

C. Mina: ``Mapinfo SpatialWare: a Spatial Information Server for RDBMS", Proceedings 24th International Conference on Very Large Data Bases (VLDB'98), p.704, New York, NY, 1998.

Y. Mond and Y. Raz: ``Concurrency Control in B$^+$-trees Databases Using Preparatory Operations", Proceedings 11th International Conference on Very Large Data Bases (VLDB'85), pp.331-334, Stockholm, Sweden, 1985.

B. Moon, H.V. Jagadish, C. Faloutsos and J.H. Saltz: ``Analysis of the Clustering Properties of the Hilbert Space-Filling Curve", IEEE Transactions on Knowledge and Data Engineering, Vol.13, No.1, pp.124-141, 2001.

A. Nanopoulos and P. Bozanis: ``Categorical Range Queries in Large Databases", Proceedings International Symposium on Spatial and Temporal Databases (SSTD'03), pp.122-139, Santorini Island, 2003.

A. Nanopoulos, Y. Theodoridis and Y. Manolopoulos: ``C$^2$P - Clustering with Closest Pairs", Proceedings 27th International Conference on Very Large Data Bases (VLDB'01), pp.331-340, Rome, Italy, 2001.

A. Nanopoulos, Y. Theodoridis and Y. Manolopoulos: ``An Efficient and Effective Algorithm for Density Biased Sampling", Proceedings 11th ACM International Conference on Information and Knowledge Management (CIKM'02), pp.398-404, MacLean, VA, 2002.

A. Nanopoulos, M. Vassilakopoulos and Y. Manolopoulos: ``Performance Evaluation of Lazy Deletion Methods in R-trees", GeoInformatica, Vol.7, No.4, pp.337-354, 2003.

B. Nam and A. Sussman: ``A Comparative Study of Spatial Indexing Techniques for Multidimensional Scientific Datasets", Proceedings 16th International Conference on Scientific and Statistical Database Management (SSDBM'04), pp.171-180, Santorini Island, Greece, 2004.

M.A. Nascimento and J.R.O. Silva: ``Towards Historical R-trees", Proceedings 13th ACM Symposium on Applied Computing (SAC'98), pp.235-240, Atlanta, GA, 1998.

M.A. Nascimento, J.R.O. Silva and Y. Theodoridis: ``Evaluation of Access Structures for Discretely Moving Points", Proceedings 1st International Symposium on Spatiotemporal Database Management (STDBM'99), pp.171-188, Edinburgh, Scotland, 1999.

V. Ng and T. Kameda: ``Concurrent Access to R-trees", Proceedings 3rd International Symposium on Spatial Databases (SSD'93), pp.142-161, Singapore, 1993.

V. Ng and T. Kameda: ``The R-link Tree: a Recoverable Index Structure for Spatial Data", Proceedings 5th International Workshop on Database and Expert Systems Applications (DEXA'94), pp.163-172, Athens, Greece, 1994.

K. S. Oh, Y. Feng, K. Kaneko and A. Makinouchi: ``SOM Based R$^*$-tree for Similarity Retrieval", Proceedings 7th International Conference on Database Systems for Advanced Applications (DASFAA'01), pp.182-198, Hong Kong, China, 2001.

F. Olken and D. Rotem: ``Sampling from Spatial Databases", Proceedings 9th IEEE International Conference on Data Engineering (ICDE’93), pp.199-208, Vienna, Austria, 1993.

P. Oosterom: ``Reactive Data Structures for Geographic Information Systems", Ph.D. dissertation, University of Leiden, 1990.

Oracle WebSite: http://www.oracle.com.

B.-U. Pagel and H.-W. Six: ``Are Window Queries Representative for Arbitrary Range Queries?", Proceedings 15th ACM Symposium on Principles of Database Systems (PODS'96), pp.150-160, Montreal, Canada, 1996.

B.-U. Pagel, H.-W. Six, H. Toben and P. Widmayer: ``Towards an Analysis of Range Query Performance", Proceedings 12th ACM Symposium on Principles of Database Systems (PODS'93), pp.214-221, Washington, DC, 1993.

B.-U. Pagel, H.-W. Six and M. Winter: ``Window Query-Optimal Clustering of Spatial Objects", Proceedings 14th ACM Symposium on Principles of Database Systems (PODS'95), pp.86-94, San Jose, CA, 1995.

D. Papadias and D. Arkoumanis: ``Approximate Processing of Multiway Spatial Joins in Very Large Databases", Proceedings 8th International Conference on Extending Database Technology (EDBT'02), pp.179-196, Prague, Czech Republic, 2002.

D. Papadias, P. Kanlis, J. Zhang and Y. Tao: ``Efficient OLAP Operations in Spatial Data Warehouses", Proceedings 7th International Symposium on Spatial and temporal Databases (SSTD'01), pp.443-459, Redondo Beach, CA, 2001.

D. Papadias, N. Mamoulis and Y. Theodoridis. ``Processing and Optimization of Multiway Spatial Joins Using R-trees", Proceedings 18th ACM Symposium on Principles of Database Systems (PODS'99), pp.44-55, Philadelphia, PA, 1999.

D. Papadias, N. Mamoulis and Y. Theodoridis: ``Constraint-based Processing of Multi-way Spatial Joins", Algorithmica, Vol.30, No.2, pp.188-215, 2001.

D. Papadias, Y. Tao, P. Kanlis and J. Zhang: ``Indexing Spatio-Temporal Data Warehouses", Proceedings 18th IEEE International Conference on Data Engineering (ICDE'02), pp.166-175, San Jose, CA, 2002.

D. Papadias, Y. Theodoridis, T. Sellis and M. Egenhofer: ``Topological Relations in the World of Minimum Bounding Rectangles: a Study with R-trees", Proceedings ACM SIGMOD Conference on Management of Data, pp.92-103, San Jose, CA, 1995.

A.N. Papadopoulos and Y. Manolopoulos: ``Parallel Processing of Nearest Neighbor Queries in Declustered Spatial Data", Proceedings 4th ACM International Symposium on Advances in Geographic Information Systems (GIS'96), pp.37-43, Rockville, MD, 1996.

A.N. Papadopoulos and Y. Manolopoulos: ``Performance of Nearest Neighbor Queries in R-trees", Proceedings 6th International Conference on Database Theory (ICDT'97), pp.394-408, Delphi, Greece, 1997.

A.N. Papadopoulos and Y. Manolopoulos: ``Nearest-Neighbor Queries in Shared-Nothing Environments", Geoinformatica, Vol.1, No.4, pp.369-392, 1997.

A.N. Papadopoulos and Y. Manolopoulos: ``Similarity Query Processing Using Disk Arrays", Proceedings ACM SIGMOD Conference on Management of Data, pp.225-236, Seattle, WA, 1998.

A.N. Papadopoulos and Y. Manolopoulos: ``Parallel Bulk-Loading of Spatial Data", Parallel Computing, Vol.29, No.10, pp.1419-1444, 2003.

A.N. Papadopoulos, P. Rigaux and M. Scholl: ``A Performance Evaluation of Spatial Join Processing Strategies", Proceedings 6th International Symposium on Spatial Databases (SSD'99), pp.286-307, Hong-Kong, China, 1999.

H.-H. Park, G.-H. Cha and C.-W. Chung. ``Multi-way Spatial Joins Using R-trees: Methodology and Performance Evaluation", Proceedings 6th International Symposium on Spatial Databases (SSD'99), pp.229-250, Hong-Kong, China, 1999.

H.-H. Park and C.-W. Chung: ``Complexity of Estimating Multi-way Join Result Sizes for Area Skewed Spatial Data", Information Processing Letters, Vol.76, No.3, pp.121-129, 2000.

D.J. Park, S. Heu and H.J. Kim: ``The RS-tree - an Efficient Data Structure for Distance Browsing Queries", Information Processing Letters, Vol.80, No.4, pp.195-203, 2001.

M. Park and S. Lee: ``Optimizing Both Cache and Disk Performance of R-trees", Proceedings 14th International Workshop on Database and Expert Systems Applications (DEXA'03), pp.139-147, Prague, Czech Republic, 2003.

J. Patel and D. DeWitt. ``Partition Based Spatial-Merge Join", Proceedings ACM SIGMOD Conference on Management of Data, pp.259-270, Montreal, Canada, 1996.

D.A. Patterson, G. Gibson and R.H. Katz: ``A Case for Redundant Arrays of Inexpensive Disks (RAID)", Proceedings ACM SIGMOD Conference on Management of Data, pp.109-116, Chicago, IL, 1988.

M. Pelanis, S. Saltenis, and C.S. Jensen: ``Indexing the Past, Present and Anticipated Future Positions of Moving Objects'', Technical Report TR-78, Time Center, 1999. Time Center Website: http://www.cs.auc.dk/TimeCenter/

D. Pfoser, C.S. Jensen and Y. Theodoridis: ``Novel Approaches to the Indexing of Moving Object Trajectories", Proceedings 26th International Conference on Very Large Data Bases (VLDB'00), pp.395-406, Cairo, Egypt, 2000.

PostgreSQL Website: http://www.postgresql.org

S. Prabhakar, Y. Xia, D.V. Kalashnikov, W.G. Aref and S.E. Hambrusch: ``Query Indexing and Velocity Constrained Indexing: Scalable Techniques for Continuous Queries on Moving Objects", IEEE Transactions on Computers, Vol.51, No.10, pp.1124-1140, 2002.

C. Procopiuc, P. Agarwal and S. Har-Peled: ``STAR-tree: an Efficient Self-adjusting Index for Moving Points", Proceedings 3rd Workshop on Algorithm Engineering and Experiments (ALENEX'01), pp.178-193, San Francisco, CA, 2001.

G. Proietti and C. Faloutsos: ``Analysis of Range Queries and Self-Spatial Join Queries on Real Region Datasets Stored Using an R-tree", IEEE Transactions on Knowledge and Data Engineering, Vol.12, No.5, pp.751-762, 2000.

K. Raptopoulou, Y. Manolopoulos and A.N. Papadopoulos: ``Fast Nearest-Neighbor Search in Moving Object Databases'', International Journal on Advances of Computer Science for Geographical Information Systems (Geoinformatica), Vol.7, No.2, pp.113-137, 2003.

K. Raptopoulou, A.N. Papadopoulos and Y. Manolopoulos: ``Incremental Nearest-Neighbor Search in Moving Objects'', Proceedings of IEEE International Conference on Pervasive Services (ICPS'05), Santorini Island, 2005.

S. Ravada and G. Sharma: ``Oracle8i: Experiences with Extensible Databases", Proceedings 6th International Symposium on Spatial Databases (SSD'99), pp.355-359, Hong Kong, China, 1999.

N. Roussopoulos, S. Kelley and F. Vincent. ``Nearest Neighbor Queries", Proceedings ACM SIGMOD Conference on Management of Data, pp.71-79, San Jose, CA, 1995.

N. Roussopoulos and Y. Kotidis ``Cubetree: Organization of and Bulk Updates on the Data Cube", Proceedings ACM SIGMOD Conference on Management of Data, pp.89-99, Tucson, AZ, 1997.

N. Roussopoulos and D. Leifker: ``Direct Spatial Search on Pictorial Databases Using Packed R-trees", Proceedings ACM SIGMOD Conference on Management of Data, pp.17-31, Austin, TX, 1985.

Y. Sagiv: ``Concurrent Operations on B-trees with Overtaking", Proceedings 4th ACM Symposium on Principles of Database Systems (PODS'85), pp.28-37, Portland, OR, 1985.

S. Saltenis and C.S. Jensen: ``R-tree based Indexing of General Spatiotemporal Data", Technical Report TR-45, Time Center, 1999. Time Center Website: http://www.cs.auc.dk/TimeCenter/

S. Saltenis, C.S. Jensen, S. Leutenegger and M. Lopez: ``Indexing the Positions of Continuously Moving Objects", Proceedings ACM SIGMOD Conference on Management of Data, pp.331-342, Dallas, TX, 2000.

H. Samet: The Design and Analysis of Spatial Data Structures, Addison-Wesley, Reading MA, 1990.

H. Samet: Applications of Spatial Data Structures, Addison-Wesley, Reading MA, 1990.

J. Schiller and A. Voisard (eds.): Location-based Services, Morgan Kaufmann/Elsevier, San Francisco, CA, 2004.

M. Schiwietz: ``Speicherung und Anfragebearbeitung Komplexer Geo-objekte", Ph.D. dissertation, Ludwig-Maximilians-Universitaet Muenchen, 1993.

B. Schnitzer and S. Leutenegger: ``Master-Client R-trees - a New Parallel R-tree Architecture", Proceedings 11th International Conference on Scientific and Statistical Database Management (SSDBM'99), pp.68-77, Cleveland, OH, 1999.

T. Schrek and Z. Chen: ``Branch Grafting Method for R-tree Implementation", Journal of Systems and Software, Vol.53, No.1, pp.83-93, 2000.

B. Seeger and P.A. Larson: ``Multi-disk B-trees", Proceedings ACM SIGMOD Conference on Management of Data, pp.436-445, Denver, Colorado, 1991.

T. Seidl and H.-P. Kriegel: ``Optimal Multi-Step $k$-Nearest Neighbor Search", Proceedings ACM SIGMOD Conference on Management of Data, pp.154-165, Seattle, WA, 1998.

T. Sellis, N. Roussopoulos and C. Faloutsos: ``The R$^+$-tree - a Dynamic Index for Multidimensional Objects", Proceedings 13th International Conference on Very Large Data Bases (VLDB'87), pp.507-518, Brighton, England, 1987.

T. Sellis, N. Roussopoulos and C. Faloutsos: ``Multidimensional Access Methods: Trees Have Grown Everywhere", Proceedings 23rd International Conference on Very Large Data Bases (VLDB'97), pp.13-14, Athens, Greece, 1997.

J. Sharma: ``Implementation of Spatial and Multimedia Extensions in Commercial Systems", tutorial during the 6th International Symposium on Spatial Databases (SSD'99), Hong-Kong, China, 1999.

D. Shasha and N. Goodman: ``Concurrent Search Structure Algorithms", ACM Transaction on Database Systems, Vol.13, No.1, pp.53-90, 1988.

A. Shatdal and J.F. Naughton: ``Using Shared Virtual Memory for Parallel Processing", Proceedings ACM SIGMOD Conference on Management of Data, pp.119-128, Washington, DC, 1993.

H. Shin, B. Moon and S. Lee: ``Adaptive Multi-Stage Distance Join Processing", Proceedings ACM SIGMOD Conference on Management of Data, pp.343-354, Dallas, TX, 2000.

A.P. Sistla, O. OWolfson, S. Chamberlain and S. Dao: ``Modeling and Querying Moving Objects", Proceedings 13th IEEE International Conference on Data Engineering (ICDE'97), pp.422-432, Birmingham, UK, 1997.

R. Snodgrass and T. Ahn: ``A Taxonomy of Time in Databases", Proceedings ACM SIGMOD Conference on Management of Data, pp.236-246, Austin, TX, 1985.

I. Stanoi, D. Agrawal and A. Abbadi. ``Reverse Nearest Neighbor Queries for Dynamic Datasets", Proceedings 5th ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery (DMKD'00), pp.44-53, Dallas, TX, 2000.

M. Stonebraker, T. Sellis and E. Hanson: ``An Analysis of Rule Indexing Implementations in Data Base Systems", Proceedings 1st Conference on Expert Database Systems, pp.465-476, Charleston, SC, 1986.

C. Sun, D. Agrawal and A. El Abbadi: ``Selectivity Estimation for Spatial Joins with Geometric Selections", Proceedings 18th IEEE International Conference on Data Engineering (ICDE'02), pp.609-626, San Jose, CA, 2002.

Y. Tao and D. Papadias: ``Efficient Historical R-trees", Proceedings 13th International Conference on Scientific and Statistical Database Management (SSDBM'01), pp.223-232, Fairfax, VA, 2001.

Y. Tao and D. Papadias: ``MV3R-tree - a Spatio-Temporal Access Method for Timestamp and Interval Queries", Proceedings 27th International Conference on Very Large Data Bases (VLDB'01), pp.431- 440, Rome, Italy, 2001.

Y. Tao and D. Papadias: ``Time-Parameterized Queries in Spatio-Temporal Databases'', Proceedings ACM SIGMOD Conference on Management of Data, pp. 334-345, Madison WI, 2002.

Y. Tao and D. Papadias: ``Performance Analysis of R*-trees with Arbitrary Node Extents", IEEE Transactions on Knowledge and Data Engineering, Vol.16, No.6, pp.653-668, 2004.

Y. Tao, D. Papadias, N. Mamoulis and J. Zhang: ``An Efficient Cost Model for $k$-NN Search", Technical Report HKUST-CS01-13, 2001. %+++ yparxei neoterh version ?

Y. Tao, D. Papadias and J. Sun: ``The TPR$*$-tree: an Optimized Spatiotemporal Access Method for Predictive Queries", Proceedings 28th International Conference on Very Large Data Bases (VLDB'02), pp.790-801, Berlin, Germany, 2003.

Y. Tao, D. Papadias and J. Zhang: ``Aggregate Processing of Planar Points", Proceedings 8th International Conference on Extending Database Technology (EDBT'02), pp.682-700, Prague, Czech Republic, 2002.

Y. Tao, D. Papadias and J. Zhang: ``Cost Models for Overlapping and Multiversion Structures", ACM Transactions on Database Systems, Vol.27, No.3, pp.299-342, 2002.

Y. Tao, J. Sun and D. Papadias: ``Analysis of Predictive Spatio-Temporal Queries", ACM Transactions on Database Systems, Vol.28, No.4, pp.295-336, 2003.

Y. Tao, J. Zhang, D. Papadias and N. Mamoulis: ``An Efficient Cost Model for Optimization of Nearest Neighbor Search in Low and Medium Dimensional Spaces", IEEE Transactions on Knowledge and Data Engineering, Vol.16, No.10, pp.1169-1184, 2004.

Y. Theodoridis: ``Ten Benchmark Database Queries for Location-Based Services", The Computer Journal, Vol.46, No.6, pp.713-725, 2003.

Y. Theodoridis and T. Sellis: ``Optimization Issues in R-tree Construction", Proceedings International Workshop on Advanced Research in Geographic Information Systems (IGIS'94), pp.270-273, Ascona, Switzerland, 1994.

Y. Theodoridis and T. Sellis: ``A Model for the Prediction of R-tree Performance", Proceedings 15th ACM Symposium on Principles of Database Systems (PODS'96), pp.161-171, Montreal, Canada, 1996.

Y. Theodoridis, J.R.O. Silva and M.A. Nascimento: ``On the Generation of Spatiotemporal Datasets", Proceedings 6th International Symposium on Spatial Databases (SSD'99), pp.147-164, Hong Kong, China, 1999.

Y. Theodoridis, E. Stefanakis and T. Sellis: ``Cost Models for Join Queries in Spatial Databases", Proceedings 14th IEEE International Conference on Data Engineering (ICDE'98), pp.476-483, Orlando, FL, 1998.

Y. Theodoridis, E. Stefanakis and T. Sellis: ``Efficient Cost Models for Spatial Queries Using R-trees", IEEE Transactions on Knowledge and Data Engineering, Vol.12, No.1, pp.19-32, 2000.

Y. Theodoridis, M. Vazirgiannis and T. Sellis: ``Spatio-Temporal Indexing for Large Multimedia Applications", Proceedings 3rd IEEE International Conference on Multimedia Computing and Systems (ICMCS'96), pp.441-448, Hiroshima, Japan, 1996.

TIGER/Line Files, 1994 Technical Documentation, Prepared by the Bureau of the Census, Washington, DC, 1994.

V. Vasaitis, A. Nanopoulos and P. Bozanis: ``Merging R-trees". Proceedings 16th International Conference on Scientific and Statistical Database Management (SSDBM'04), pp.41-150, Santorini Island, Greece, 2004.

M. Vazirgiannis, Y. Theodoridis and T. Sellis: ``Spatio-Temporal Composition and Indexing in Large Multimedia Applications", ACM Multimedia Systems, Vol.6, No.4, pp.284-298, 1998.

B. Wang, H. Horinokuchi, K. Kaneko and A. Makinouchi: ``Parallel R-tree Search Algorithm on DSVM", Proceedings 6th International Conference on Database Systems for Advanced Applications (DASFAA'99), pp.237-245, Hsinchu, Taiwan, 1999.

R. Weber, H.J. Schek and S. Blott: ``A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces", Proceedings 24th International Conference on Very Large Data Bases (VLDB'98), pp.194-205, New York, NY, 1998.

D.A White and R. Jain: ``Similarity Indexing: Algorithms and Performance", Proceedings 4th International Conference on Storage and Retrieval for Image and Video Databases (SPIE'96), pp.62-73, San Diego, CA, 1996.

D.A. White and R. Jain: ``Similarity Indexing with the SS-tree", Proceedings 12th IEEE International Conference on Data Engineering (ICDE'96), pp.516-523, New Orleans, LA, 1996.

O. Wolfson, B. Xu, S. Chamberlain and L. Jiang: ``Moving Objects Databases: Issues and Solutions", Proceedings 10th International Conference on Scientific and Statistical Database Management (SSDBM'98),pp.111-122, Capri, Italy, 1998.

C.H. Wu, L.P. Chang and T.W. Kuo: ``An Efficient R-tree Implemantation over Flash-memory Storage Systems", Proceedings 11th ACM International Symposium on Advances in Geographical Information Systems (GIS'03), pp.17-24, New Orleans, LA, 2003.

Y. Xia and S. Prabhakar: ``Q+R-tree: Efficient Indexing for Moving Object Databases", Proceedings 8th International Conference on Database Systems for Advanced Applications (DASFAA'03), pp.175-182, Kyoto, Japan, 2003.

X. Xu, J. Han and W. Lu: ``RT-tree: an Improved R-tree Index Structure for Spatiotemporal Databases", Proceedings 4th International Symposium on Spatial Data Handling (SDH'90), pp.1040-1049, Zurich, Switzerland, 1990.

J. Zhang, N. Mamoulis, D. Papadias and Y. Tao: ``All-Nearest-Neighbors Queries in Spatial Databases", Proceedings 16th International Conference on Scientific and Statistical Database Management (SSDBM'04), pp.297-306, Santorini Island, Greece, 2004.