Towards Optimal Indexing for Segment Databases.

@inproceedings{DBLP:conf/edbt/BertinoCS98,
  author    = {Elisa Bertino and
               Barbara Catania and
               Boris Shidlovsky},
  editor    = {Hans-J{\"o}rg Schek and
               F{\`e}lix Saltor and
               Isidro Ramos and
               Gustavo Alonso},
  title     = {Towards Optimal Indexing for Segment Databases},
  booktitle = {Advances in Database Technology - EDBT'98, 6th International
               Conference on Extending Database Technology, Valencia, Spain,
               March 23-27, 1998, Proceedings},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {1377},
  year      = {1998},
  isbn      = {3-540-64264-1},
  pages     = {39-53},
  ee        = {db/conf/edbt/BertinoCS98.html, http://link.springer.de/link/service/series/0558/bibs/1377/13770039.htm},
  crossref  = {DBLP:conf/edbt/98},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

ACM SIGMOD Anthology

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the CD and click on the path of your mount point:
  /Anthology/An5-2 or /cdrom

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the DVD and click on the path of your mount point:
  /Anthology/aDVD1 or /dvd

Online Edition: Springer LINK

References

[1]

Lars Arge: The Buffer Tree: A New Technique for Optimal I/O-Algorithms (Extended Abstract). WADS 1995: 334-345 BibTeX

[2]

Lars Arge, Darren Erik Vengroff, Jeffrey Scott Vitter: External-Memory Algorithms for Processing Line Segments in Geographic Information Systems (Extended Abstract). ESA 1995: 295-310 BibTeX

[3]

Lars Arge, Jeffrey Scott Vitter: Optimal Dynamic Interval Management in External Memory (extended abstract). FOCS 1996: 560-569 BibTeX

[4]

...

[5]

Bernard Chazelle, Leonidas J. Guibas: Fractional Cascading: I. A Data Structuring Technique. Algorithmica 1(2): 133-162(1986) BibTeX

[6]

Siu-Wing Cheng, Ravi Janardan: Efficient Dynamic Algorithms for Some Geometric Intersection Problems. Inf. Process. Lett. 36(5): 251-258(1990) BibTeX

[7]

...

[8]

Douglas Comer: The Ubiquitous B-Tree. ACM Comput. Surv. 11(2): 121-137(1979) BibTeX

[9]

...

[10]

Antonin Guttman: R-Trees: A Dynamic Index Structure for Spatial Searching. SIGMOD Conference 1984: 47-57 BibTeX

[11]

Christian Icking, Rolf Klein, Thomas Ottmann: Priority Search Trees in Secondary Memory (Extended Abstract). WG 1987: 84-93 BibTeX

[12]

Kurt Mehlhorn, Stefan Näher: Dynamic Fractional Cascading. Algorithmica 5(2): 215-241(1990) BibTeX

[13]

Paris C. Kanellakis, Gabriel M. Kuper, Peter Z. Revesz: Constraint Query Languages. J. Comput. Syst. Sci. 51(1): 26-52(1995) BibTeX

[14]

Paris C. Kanellakis, Sridhar Ramaswamy, Darren Erik Vengroff, Jeffrey Scott Vitter: Indexing for Data Models with Constraints and Classes. J. Comput. Syst. Sci. 52(3): 589-612(1996) BibTeX

[15]

Manolis Koubarakis: Database models for infinite and indefinite temporal information. Inf. Syst. 19(2): 141-173(1994) BibTeX

[16]

Edward M. McCreight: Priority Search Trees. SIAM J. Comput. 14(2): 257-276(1985) BibTeX

[17]

Jürg Nievergelt, Edward M. Reingold: Binary Search Trees of Bounded Balance. SIAM J. Comput. 2(1): 33-43(1973) BibTeX

[18]

Jan Paredaens: Spatial Databases, The Final Frontier. ICDT 1995: 14-32 BibTeX

[19]

Sridhar Ramaswamy, Sairam Subramanian: Path Caching: A Technique for Optimal External Searching. PODS 1994: 25-35 BibTeX

[20]

Sridhar Ramaswamy: Efficient Indexing for Constraint and Temporal Databases. ICDT 1997: 419-431 BibTeX

[21]

Sairam Subramanian, Sridhar Ramaswamy: The P-range Tree: A New Data Structure for Range Searching in Secondary Memory. SODA 1995: 378-387 BibTeX