Publications for Access Methods for High-Dimensional Data Spaces

1. Emrich T., Kriegel H.-P., Kröger P., Renz M., Züfle A.: Incremental Reverse Nearest Neighbor Ranking in Vector Spaces, Proc. 11th Int. Symposium on Spatial and Temporal Databases (SSTD'09), Aalborg, Denmark, 2009, 265-282.
   Paper (pdf 432K)
   

2. Achtert E., Kriegel H.-P., Kröger P., Renz M., Züfle A.: Reverse k-nearest neighbor search in dynamic and general metric databases, Proc. 12th Int. Conf. on Extending Database Technology (EDBT'09), Saint-Petersburg, Russia, 2009, pp. 886-897.
   Paper (pdf 571K)
   

3. Kriegel H.-P., Kröger P., Renz M., Züfle A., Katzdobler A.: Incremental Reverse Nearest Neighbor Ranking, Proc. 25th Int. Conf. on Data Engineering (ICDE'09), Shanghai, China, 2009, pp. 1560-1567.
   Paper (pdf 479K)
   

4. Kriegel H.-P., Kröger P., Renz M., Züfle A., Katzdobler A.: Reverse k-Nearest Neighbor Search based on Aggregate Point Access Methods, Proc. 21st Int. Conf. on Scientific and Statistical Database Management (SSDBM'09), New Orleans, LA, 2009, pp. 444-460.
   Paper (pdf 487K)
   

5. Böhm C., Kunath P., Pryakhin A., Schubert M.: Querying Objects modeled by Arbitrary Probability Distributions, Proc. 10th Int. Symp. on Spatial and Temporal Databases (SSTD'07), Boston, USA, 2007, pp. 294-311.
   Paper (pdf 666K)
   

6. Kriegel H.-P., Kröger P., Kunath P., Renz M.: Generalizing the Optimality of Multi-Step k-Nearest Neighbor Query Processing, Proc. 10th Int. Symp. on Spatial and Temporal Databases (SSTD'07), Boston, USA, 2007, pp. 75-92.
   Paper (pdf 315K)
   

7. Böhm C., Kunath P., Pryakhin A., Schubert M.: Effective and Efficient Indexing for Large Video Databases, Proc. 12. GI-Fachtagung für Datenbanksysteme in Business, Technologie und Web (BTW'07), Aachen, Germany, 2007, pp. 132-151.
   Paper (pdf 502K)
   

8. Achtert E., Böhm C., Kröger P., Kunath P., Pryakhin A., Renz M.: Efficient Reverse k-Nearest Neighbor Estimation, Proc. 12. GI-Fachtagung für Datenbanksysteme in Business, Technologie und Web (BTW'07), Aachen, Germany, 2007, pp. 344-363.
   Paper (pdf 374K)
   

9. Aßfalg J., Kriegel H.-P., Kröger P., Kunath P., Pryakhin A., Renz M.: Interval-focused Similarity Search in Time Series Databases, Proc. 12th Int. Conf. on Database Systems for Advance Applications (DASFAA'07), Bangkok, Thailand, 2007, pp. 586-597.
   Paper (pdf 205K)
   

10. Böhm C., Gruber M., Kunath P., Pryakhin A., Schubert M.: ProVeR: Probabilistic Video Retrieval using the Gauss-Tree, (demonstration), Proc. 23rd Int. Conf. on Data Engineering (ICDE'07), Istanbul, Turkey, 2007, paper 203.
    Paper (pdf 574K)
    

11. Kailing K., Kriegel H.-P., Pfeifle M., Schönauer S.: Extending Metric Index Structures for Efficient Range Query Processing, in: Knowledge and Information Systems (KAIS), Vol. 10, No. 2, 2006, pp. 211-227.
    The original publication is available at www.springerlink.com.
    

12. Achtert E., Böhm C., Kröger P., Kunath P., Pryakhin A., Renz M.: Approximate Reverse k-Nearest Neighbor Queries in General Metric Spaces, Proc. 15th ACM Conf. on Information and Knowledge Management (CIKM'06), Arlington, U.S.A., 2006, pp. 788-789.
    Paper (pdf 79K)
    

13. Böhm C., Pryakhin A., Schubert M.: Probabilistic Ranking Queries on Gaussians, Proc. 18th Int. Conf. on Scientific and Statistical Database Management (SSDBM'06), Vienna, Austria, 2006, pp. 169-178.
    Paper (pdf 570K)
    

14. Achtert E., Böhm C., Kröger P., Kunath P., Pryakhin A., Renz M.: Efficient Reverse k-Nearest Neighbor Search in Arbitrary Metric Spaces, Proc. ACM SIGMOD Int. Conf. on Management of Data (SIGMOD'06), Chicago, IL, 2006, pp. 515-526.
    Paper (pdf 358K)
    

15. Kriegel H.-P., Kröger P., Schubert M., Zhu Z.: Efficient Query Processing in Arbitrary Subspaces Using Vector Approximations, Proc. 18th Int. Conf. on Scientific and Statistical Database Management (SSDBM'06), Vienna, Austria, 2006, pp. 184-190.
    Paper (pdf 94K)
    

16. Böhm C., Pryakhin A., Schubert M.: The Gauss-Tree: Efficient Object Identification of Probabilistic Feature Vectors, Proc. 22nd Int. Conf. on Data Engineering (ICDE'06), Atlanta, GA, 2006.
    Paper (pdf 558K)
    

17. Böhm C., Kriegel H.-P., Kröger P., Linhart P.: Selectivity Estimation of High Dimensional Window Queries Via Clustering, Proc. 9th Int. Symp. on Spatial and Temporal Databases (SSTD'05), Angra dos Reis, Brazil, 2005, pp. 1-18.
    Paper (pdf 278K)

18. Kriegel H.-P., Kunath P., Pfeifle M., Renz M.: Approximated Clustering of Distributed High-Dimensional Data, Proc. 9th Pacific-Asia Conf. on Knowledge Discovery and Data Mining (PAKDD'05), Hanoi, Vietnam, 2005, in: Lecture Notes in Computer Science, Springer, Vol. 3518, 2005, pp. 432-441.
    Paper (pdf 97K)
    

19. Kriegel H.-P., Kunath P., Pfeifle M., Renz M.: Database Support for Haptic Exploration in Very Large Virtual Environments, Proc. 11th Int. MultiMedia Modeling Conf. (MMM'05), Melbourne, Australia, 2005, pp. 352-357.
    Paper (pdf 285K)
    

20. Kriegel H.-P., Kunath P., Pfeifle M., Renz M.: Object-Relational Management of Complex Geographical Objects, 12th Int. Workshop on Geographic Information Systems (ACM-GIS 2004), Washington DC, USA, 2004, pp. 109-117.
    Paper (pdf 178K)
    

21. Kriegel H.-P., Kunath P., Pfeifle M., Renz M.: Efficient Query Processing on Relational Data-Partitioning Index Structures, 16th Int. Conf. on Scientific and Statistical Database Management (SSDBM 2004), Santorini Island, Greece, 2004, pp. 119-122.
    Paper (pdf 65K)
    

22. Kriegel H.-P., Kunath P., Pfeifle M., Renz M.: Spatial Join for High-Resolution Objects, 16th Int. Conf. on Scientific and Statistical Database Management (SSDBM 2004), Santorini Island, Greece, 2004, pp. 151-160.
    Paper (pdf 218K)
    

23. Kailing K., Kriegel H.-P., Pfeifle M., Schönauer S.: Efficient Indexing of Complex Objects for Density-based Clustering, Proc. 5th Int. Workshop on Multimedia Data Mining (MDM/KDD), Seattle, WA, 2004, pp. 28-37.
    Paper (pdf 427K)
    

24. Kriegel H.-P., Kunath P., Pfeifle M., Renz M.: Statistic Driven Acceleration of Object-Relational Spatial Index Structures, Proc. 9th Int. Conf. on Database Systems for Advanced Applications (DASFAA 2004), Jeju Island, Korea, 2004, pp. 169-183.
    Paper (pdf 127K)
    

25. Kriegel H.-P., Pfeifle M., Pötke M., Seidl T.: A Cost Model for Spatial Intersection Queries on RI-Tree, Proc. 9th Int. Conf. on Database Systems for Advanced Applications (DASFAA 2004), Jeju Island, Korea, 2004, pp. 331-338.
    Paper (pdf 69K)
    

26. Böhm C., Krebs F.: The k-Nearest Neighbor Join: Turbo Charging the KDD Process, in: Knowledge and Information Systems (KAIS), Vol. 6, No. 6, 2004, pp. 728-749.
    Paper (pdf 367K)

27. Böhm C., Krebs F.: Supporting KDD Applications by the k-Nearest Neighbor Join, Proc. 14th Int. Conf. on Database and Expert Systems Applications (DEXA), Prague, Czech Republic, 2003, in: Lecture Notes in Computer Science, Vol. 2736, Springer, 2003, pp. 504-516.
    Paper (pdf 256K)
    

28. Kriegel H.-P., Kunath P., Pfeifle M., Pötke M., Renz M., Strauß P.-M.: Stochastic Driven Relational R-Tree, V Simpósio Brasileiro de Geoinformática (GEOINFO 2003), Campos do Jordão (SP), Brazil, 2003.
    Paper (pdf 89K)
    

29. Kriegel H.-P., Kunath P., Pfeifle M., Renz M.: Efficient Query Processing on the Relational Quadtree, V Simpósio Brasileiro de Geoinformática (GEOINFO 2003), Campos do Jordão (SP), Brazil, 2003.
    Paper (pdf 123K)
    

30. Kriegel H.-P., Kunath P., Pfeifle M., Renz M.: Acceleration of Relational Index Structures Based on Statistics, Proc. 15th Int. Conf. on Scientific and Statistical Database Management (SSDBM 2003), Cambridge, MA, 2003, pp. 258-261.
    Paper (pdf 60K)
    

31. Kriegel H.-P., Pfeifle M., Pötke M., Seidl T.: The Paradigm of Relational Indexing: A Survey, Proc. 10. GI-Fachtagung Datenbanksysteme für Business, Technologie und Web (BTW), Leipzig, 2003, in: Lecture Notes in Informatics (LNI), Springer, Vol. 26, 2003, pp. 285-304.
    Paper (pdf 87K)
    

32. Kriegel H.-P., Pfeifle M., Pötke M., Renz M., Seidl T.: Spatial Data Management for Virtual Product Development, in: Lecture Notes in Computer Science, Springer, Vol. 2598, 2003, pp. 216-230.
    Abstract
    

33. Böhm C.: Powerful Database Primitives to Support High Performance Data Mining, (Tutorial) 2nd IEEE Int. Conf. on Data Mining (ICDM), Maebashi City, Japan, 2002.
    Paper (pdf 974K)

34. Böhm C., Krebs F.: High Performance Data Mining Using the Nearest Neighbor Join, Proc. 2nd IEEE Int. Conf. on Data Mining (ICDM), Maebashi City, Japan, 2002, pp. 43-50.
    Paper (pdf 293K)

35. Böhm C.: Similarity Search and Data Mining: Database Techniques Supporting Next Decade's Applications, (Keynote Speech) Proc. 4th Int. Conf. on Information Integration and Web-based Applications & Services (IIWAS), Bandung, Indonesia 2002.
    Paper (pdf 207K)

36. Böhm C., Krebs F., Kriegel H.-P.: Optimal Dimension Order: A Generic Technique for the Similarity Join, Proc. 4th Int. Conf. on Data Warehousing and Knowledge Discovery (DaWaK'02), Aix-en-Provence, France, 2002, pp. 135-149.
    Paper (pdf 258K)

37. Böhm C., Berchtold S., Keim D. A.: Searching in High-dimensional Spaces: Index Structures for Improving the Performance of Multimedia Databases, in: ACM Computing Surveys, Vol. 33, No. 3, 2001, pp. 322-373.
    Paper (pdf 764K)

38. Böhm C., Kriegel H.-P., Seidl T.: Determining the Convex Hull in Large Multidimensional Databases, Proc. Int. Conf. on Data Warehousing and Knowledge Discovery (DaWaK 2001), Munich, Germany, 2001, pp. 294-306.
    Paper (pdf 235K)

39. Böhm C., Kriegel H.-P., Seidl T.: Adaptable Similarity Search Using Vector Quantization, Proc. Int. Conf. on Data Warehousing and Knowledge Discovery (DaWaK 2001), Munich, Germany, 2001, pp. 317-327.
    Paper (pdf 131K)

40. Böhm C., Braunmüller B., Krebs F., Kriegel H.-P.: Epsilon Grid Order: An Algorithm for the Similarity Join on Massive High-Dimensional Data, Proc. ACM SIGMOD Int. Conf. on Managment of Data (SIGMOD'01), Santa Barbara, CA, 2001, pp. 379-388.
    Paper (pdf 163K)

41. Berchtold S., Böhm C., Keim D. A., Krebs F., Kriegel H.-P.: On Optimizing Nearest Neighbor Queries in High-Dimensional Data Spaces, Proc. Int. Conf. on Database Theory (ICDT 2001), London, U.K., 2001, in: Lecture Notes in Computer Science, Vol. 1973, Springer, 2001, pp. 435-449.
    Paper (pdf 8.2M)

42. Böhm C., Kriegel H.-P.: A Cost Model and Index Architecture for the Similarity Join, Proc. 17th Int. Conf. on Data Engineering (ICDE), Heidelberg, Germany, 2001, pp. 411-420.
    Paper (pdf 167K)

43. Böhm C.: The Similarity Join: A Powerful Database Primitive for High Performance Data Mining, (Tutorial), 17th Int. Conf. on Data Engineering (ICDE 2001), Heidelberg, Germany, 2001, p. XVII.
    

44. Braunmüller B., Ester M., Kriegel H.-P., Sander J.: Multiple Similarity Queries: A Basic DBMS Operation for Mining in Metric Databases, in: Special Issue on "Best Papers of ICDE 2000", IEEE Transactions on Knowledge and Data Engineering (TKDE), Vol. 13, No. 1, 2001, pp. 79-95.
    Abstract
    

45. Böhm C.: A Cost Model for Query Processing in High-Dimensional Data Spaces, in: ACM Trans. on Database Systems (TODS), Vol. 25, No. 2, 2000, pp. 129-178.
    Paper (pdf 4,8MB)

46. Böhm C., Braunmüller B., Breunig M., Kriegel H.-P.: High Performance Clustering Based on the Similarity Join, Proc. 9th Int. Conf. on Information and Knowledge Management (CIKM 2000), Washington, DC, 2000, pp. 298-313.
    Paper (pdf 151K)

47. Berchtold S., Böhm C, Keim D. A., Kriegel H.-P., Xu X.: Optimal Multidimensional Query Processing Using Tree Striping, Proc. Int. Conf. on Data Warehousing and Knowledge Discovery (DaWaK 2000), Greenwich, U.K., 2000, pp. 244-257.
    Paper (pdf 1.16M)

48. Böhm C., Braunmüller B., Kriegel H.-P.: The Pruning Power: Theory and Heuristics for Mining Databases with Multiple k-Nearest-Neighbor Queries, Proc. Int. Conf. on Data Warehousing and Knowledge Discovery (DaWaK 2000), Greenwich, U.K., 2000, pp. 372-381.
    Paper (pdf 82K)

49. Berchtold S., Keim D. A., Kriegel H.-P., Seidl T.: Indexing the Solution Space: A New Technique for Nearest Neighbor Search in High-Dimensional Space, in: IEEE Transactions on Knowledge and Data Engineering (TKDE 2000), Vol. 12, No. 1, 2000, pp. 45-57.
    Abstract

50. Böhm C., Berchtold S., Kriegel H.-P., Michel U.: Multidimensional Index Structures in Relational Databases, in: Journal for Intelligent Information Systems, Vol. 15, No. 1, 2000, pp. 51-70.

51. Böhm C., Kriegel H.-P.: Dynamically Optimizing High-Dimensional Index Structures, Proc. 7th Int. Conf. on Extending Database Technology (EDBT 2000), Konstanz, Germany, 2000, pp. 36-50.
    Paper (postscript 1.9M), Paper (pdf 286K)

52. Böhm C., Braunmüller B., Kriegel H.-P., Schubert M.: Efficient Similarity Search in Digital Libraries, Proc. IEEE Int. Conf. on Advances in Digital Libraries (ADL 2000), Washington, DC, 2000, pp. 193-206.
    Paper (postscript 745K)

53. Braunmüller B., Ester M., Kriegel H.-P., Sander J.: Efficiently Supporting Multiple Similarity Queries for Mining in Metric Databases, Proc. 16th Int. Conf. on Data Engineering (ICDE 2000), San Diego, CA, 2000, pp. 256-267.
    Paper (pdf 142K)

54. Ester M., Kohlhammer J., Kriegel H.-P.: The DC-tree: A Fully Dynamic Index Structure for Data Warehouses, Proc. 16th Int. Conf. on Data Engineering (ICDE 2000), San Diego, CA, 2000, pp. 379-388.
    Paper (pdf 85K)

55. Berchtold S., Böhm C., Jagadish H. V., Kriegel H.-P., Sander J.: Independent Quantization: An Index Compression Technique for High-Dimensional Data Spaces Proc. Int. Conf. on Data Engineering (ICDE 2000), San Diego, CA, 2000, pp. 577-588.
    Paper (pdf 175K)
    

56. Berchtold S., Böhm C., Kriegel H.-P., Michel U.: Implementation of Multidimensional Index Structures for Knowledge Discovery in Relational Databases, Proc. Int. Conf. on Data Warehousing and Knowledge Discovery (DaWaK'99), Florence, Italy 1999, in: Lecture Notes in Computer Science, Vol. 1676, Springer, 1999, pp. 261-270.
    Paper (postscript 1,36MB), Paper (pdf 223K)
    

57. Böhm C., Kriegel H.-P.: Efficient Bulk Loading of Large High-Dimensional Indexes, Proc. Int. Conf. on Data Warehousing and Knowledge Discovery (DaWaK'99), Florence, Italy, 1999, in: Lecture Notes in Computer Science, Vol. 1676, Springer, 1999, pp. 251-260.
    Paper (postscript 7,76MB), Paper (pdf 1,28MB)
    

58. Böhm C., Klump G., Kriegel H.-P.: XZ-Ordering: A Space-Filling Curve for Objects with Spatial Extension, Proc. 6th Int. Symposium on Large Spatial Databases (SSD'99), Hong Kong, China, in: Lecture Notes in Computer Science, Springer, Vol. 1651, 1999, pp. 75-90.
    Paper (postscript 927K), Paper (pdf 217K)
    

59. Berchtold S., Kriegel H.-P., Pötke M.: Database Support for Concurrent Digital Mock-Up, Proc. 10th Int. IFIP TC5 WG-5.2; WG-5.3 Conf. PROLAMAT, Trento, Italy, 1998, in: Globalization of Manufacturing in the Digital Communications Era of the 21st Century: Innovation, Agility, and the Virtual Enterprise, Kluwer Academic Publishers, 1998, pp. 499-509.
    Paper (pdf 352K)
    

60. Berchtold S., Böhm C., Kriegel H.-P.: The Pyramid-Technique: Towards Breaking the Curse of Dimensionality, Proc. ACM SIGMOD Int. Conf. on Management of Data (SIGMOD'98), Seattle, WA, 1998, pp. 142-153.
    Paper (postscript 5.53M), (pdf 316K)

61. Berchtold S., Ertl B., Keim D. A., Kriegel H.-P., Seidl T.: Fast Nearest Neighbor Search in High-dimensional Space, Proc. 14th Int. Conf. on Data Engineering (ICDE'98), Orlando, FL, 1998, pp. 209-218.
    Paper (1.0M)
    

62. Berchtold S., Böhm C., Kriegel H.-P.: Improving the Query Performance of High-Dimensional Index Structures, Proc. Int. Conf. on Extending Database Technology, Valencia, Spain, 1998, pp. 216-230.
    Paper (postscript 858K)
    

63. Berchtold S., Böhm C., Keim D. A., Kriegel H.-P.: A Cost Model For Nearest Neighbor Search in High-Dimensional Data Space, Proc. ACM PODS Conf., Tucson, AZ, 1997, pp. 78-86.
    Paper (postscript 305k)

64. Berchtold S., Böhm C., Braunmüller B., Keim D. A., Kriegel H.-P.: Fast Parallel Similarity Search in Multimedia Databases, Proc. ACM SIGMOD Int. Conf. on Management of Data (SIGMOD'97), Tucson, AZ, 1997, Best Paper Award, pp. 1-12.
    Paper (postscript 397k)

65. Berchtold S., Keim D. A., Kriegel H.-P.: The X-Tree: An Index Structure for High-Dimensional Data, Proc. 22nd Int. Conf. on Very Large Data Bases (VLDB'96), Bombay, India, 1996, pp. 28-39.
    Abstract, Paper (postscript 410k)

66. Brinkhoff T., Kriegel H.-P., Seeger B.: Parallel Processing of Spatial Joins Using R-trees, Proc. 12th Int. Conf. on Data Engineering (ICDE'96), New Orleans, LA, 1996, pp. 258-265.
    Paper (postscript 343k)
    

67. Brinkhoff T., Kriegel H.-P., Schneider R., Seeger B.: GENESYS: A System for Efficient Spatial Query Processing, Proc. ACM SIGMOD Int. Conf. on Management of Data (SIGMOD'94), Minneapolis, MN, 1994, pp. 519.
    Paper (postscript 60k)

68. Brinkhoff T., Kriegel H.-P., Schneider R., Seeger B.: Multi-Step Processing of Spatial Joins, Proc. ACM SIGMOD Int. Conf. on Management of Data (SIGMOD'94), Minneapolis, MN, 1994, pp. 197-208.
    Abstract, Paper (postscript 680k)

69. Brinkhoff T., Kriegel H.-P.: Approximations for a Multi-Step Processing of Spatial Joins, Proc. Int. Workshop on Advanced Research in Geographic Information Systems, Monte Verita, Ascona, Switzerland, 1994, in: Lecture Notes in Computer Science, Vol. 884, 1994, pp. 25-34.
    Paper (postscript 430k)

70. Seeger B.: An Analysis of Schedules for Performing Multi-Page Requests, Technical Report No. 9416, Institute for Computer Science, University of Munich, 1993.
    Vollversion erhältlich unter der e-mail Addresse / full version can be received by: seeger@Mathematik.Uni-Marburg.de

71. Seeger B.: Tuning Access Methods to Supporting Data Intensive Queries, Technical Report No. 9419, Institute for Computer Science, University of Munich, 1993.
    Vollversion erhältlich unter der e-mail Addresse / full version can be received by: seeger@Mathematik.Uni-Marburg.de
    

72. ---

    1993

    Brinkhoff T., Horn H., Kriegel H.-P., Schneider R.: Eine Speicher- und Zugriffsarchitektur für effiziente Anfragebearbeitung in Geo-Datenbanksystemen (Efficient Query Handling in Spatial Database Systems (in German)), Proc. 5. GI-Fachtagung Datenbanksysteme in Büro, Technik und Wissenschaft (BTW'93) (Int. Conf. on Databases in Office, Engineering and Science), Braunschweig, Germany, 1993, in: Informatik aktuell, Springer, 1993, pp. 356-374.
    Paper (postscript 730k)

73. Brinkhoff T., Kriegel H.-P., Schneider R.: Comparison of Approximations of Complex Objects Used for Approximation-based Query Processing in Spatial Database Systems, Proc. 9th Int. Conf. on Data Engineering (ICDE'93), Vienna, Austria, 1993, pp. 40-49.
    Abstract, Paper (postscript 520k), Paper (pdf 297K)

74. Brinkhoff T., Horn H., Kriegel H.-P., Schneider R.: A Storage and Access Architecture for Efficient Query Processing in Spatial Database Systems, Proc. 3rd Int. Symposium on Large Spatial Databases (SSD'93), Singapore, 1993, in: Lecture Notes in Computer Science, Vol. 692, Springer, 1993, pp. 357-376.
    Abstract, Paper (pdf 272k)
    

75. Schiwietz M., Kriegel H.-P.: Query Processing of Spatial Objects: Complexity versus Redundancy, Proc. 3rd Int. Symposium on Large Spatial Databases (SSD'93), Singapore, 1993, in: Lecture Notes in Computer Science, Vol. 692, Springer, 1993, pp. 377-396.
    Abstract, Paper (postscript 590k)

76. Brinkhoff T., Kriegel H.-P., Seeger B.: Efficient Processing of Spatial Joins Using R-trees, Proc. ACM SIGMOD Int. Conf. on Management of Data (SIGMOD'93), Washington DC, 1993, pp. 237-246.
    Abstract, Paper (postscript 280k)

77. Kriegel H.-P., Brinkhoff T., Schneider R.: Efficient Spatial Query Processing in Geographic Database Systems, in: IEEE Data Engineering Bulletin, Vol. 16, No. 3, 1993, pp. 10-15.
    Paper (postscript 307k)

78. Kriegel H.-P., Heep S., Fahldiek A., Mysliwietz N.: Query Processing of Geometric Objects with Free Form Boundaries in Spatial Databases, Proc. 4th Int. Conf. on Database and Expert Systems Applications (DEXA'93), Prague, Czeck Republic, 1993, in: Lecture Notes in Computer Science, Vol. 720, Springer, 1993, pp. 349-360.
    Abstract, Paper (postscript 4.1M)

79. Kriegel H.-P., Schneider R., Brinkhoff T.: Potentials for Improving Query Processing in Spatial Database Systems, Proc. 9iemes Journees Bases de Donnees Avoncees (9th Conf. on Advanced Databases), Toulouse, France, 1993, pp. 11-31.
    Paper (postscript 1.1M)

80. ---

    1992

    Kriegel H.-P., Brinkhoff T., Schneider R.: An Efficient Map Overlay Algorithm based on Spatial Access Methods and Computational Geometry, Proc. Int. Workshop on Database Management Systems for Geographical Applications, Capri, Italy, 1991, in: Geographic Database Management Systems, Springer, 1992, pp. 194-211.

81. Kriegel H.-P., Heep P., Heep S., Schiwietz M., Schneider R.: An Access Method Based Query Processor for Spatial Database Systems, Proc. Int. Workshop on Database Management Systems for Geographical Applications, Capri, Italy, 1991, in: Geographic Database Management Systems, Springer, 1992, pp. 273-292.
    

82. Schneider R., Kriegel H.-P.: Indexing the Spatiotemporal Monitoring of a Polygonal Object, Proc. 5th Int. Symposium on Spatial Data Handling, Charleston, SC, 1992, pp. 200-209.
    Paper (pdf 1.6M)

83. ---

    1991

    Kriegel H.-P., Heep P., Heep S., Schiwietz M., Schneider R.: A Flexible and Extensible Index Manager for Spatial Database Systems, Proc. 2nd Int. Conf. on Database and Expert Systems Applications (DEXA'91), Berlin, Germany, 1991, pp. 179-184.

84. Schneider R., Kriegel H.-P.: The TR*-tree: A New Representation of Polygonal Objects Supporting Spatial Queries and Operations, Proc. 7th Workshop on Computational Geometry, Bern, Switzerland, 1991, in: Lecture Notes in Computer Science, Vol. 553, Springer, 1991, pp. 249-264.

85. Kriegel H.-P., Horn H., Schiwietz M.: The Performance of Object Decomposition Techniques for Spatial Query Processing, Proc. 2nd Symposium on Large Spatial Databases (SSD'91), Zurich, Switzerland, 1991, in: Lecture Notes in Computer Science, Vol. 525, Springer, 1991, pp. 257-276.
    Paper (pdf 5.2M)

86. Kriegel H.-P., Brinkhoff T., Schneider R.: The Combination of Spatial Access Methods and Computational Geometry in Geographic Database Systems, Proc. 2nd Symposium on the Design of Large Spatial Databases (SSD'91), Zurich, Switzerland, 1991, in: Lecture Notes in Computer Science, Vol. 525, Springer, 1991, pp. 5-22.
    Paper (pdf 5.1M)

87. Kriegel H.-P.: Query Processing in Spatial Database Systems, Proc. New Results and New Trends in Computer Science, Graz, Austria, 1991, in: Lecture Notes in Computer Science, Vol. 555, Springer, 1991, pp. 172-191.

88. ---

    1990

    Kriegel H.-P., Schiwietz M., Schneider R., Seeger B.: Performance Comparison of Point and Spatial Access Methods, Proc. 1st Symp. on the Design and Implementation of Large Spatial Databases, Santa Barbara, CA, 1989, in: Lecture Notes in Computer Science, Vol. 409, Springer, 1990, pp. 89-114.
    Paper (pdf 2.8M)

89. Kriegel H.-P., Seeger B., Schneider R., Beckmann N.: The R*-tree: An Efficient Access Method for Geographic Information Systems, Proc. Int. Conf. on Geographic Information Systems, Ottawa, Canada, 1990.

90. Seeger B., Kriegel H.-P.: The Buddy Tree: An Efficient and Robust Access Method for Spatial Data Base Systems, Proc. 16th Int. Conf. on Very Large Data Bases (VLDB'90), Brisbane, Australia, 1990, pp. 590-601.
    Paper (pdf 1.2M)

91. Beckmann N., Kriegel H.-P., Schneider R., Seeger B.: The R*-tree: An Efficient and Robust Access Method for Points and Rectangles, Proc. ACM SIGMOD Int. Conf. on Management of Data (SIGMOD'90), Atlantic City, NJ, 1990, pp. 322-331.
    Paper (pdf 1.2M)

92. Seeger B., Kriegel H.-P.: Design, Implementation and Performance Comparison of the Buddy Tree, Proc. Int. Conf. on Database and Expert Systems Applications (DEXA'90), Vienna, Austria, 1990, pp. 203-207.