An Index Structure for the Support of Partial and Exact Match Queries in Database Systems.

@inproceedings{DBLP:conf/adbis/SioutasTTV99,
  author    = {Spyros Sioutas and
               Athanasios K. Tsakalidis and
               John Tsaknakis and
               Bill Vassiliadis},
  editor    = {Johann Eder and
               Ivan Rozman and
               Tatjana Welzer},
  title     = {An Index Structure for the Support of Partial and Exact Match
               Queries in Database Systems},
  booktitle = {Advances in Databases and Information Systems, Third East European
               Conference, ADBIS'99, Maribor, Slovenia, September 13-16, 1999,
               Proceedings of Short Papers},
  publisher = {Institute of Informatics, Faculty of Electrical Engineering and
               Computer Science, Smetanova 17, IS-2000 Maribor, Slovenia},
  year      = {1999},
  isbn      = {86-435-0285-5},
  pages     = {24-30},
  ee        = {db/conf/adbis/SioutasTTV99.html},
  crossref  = {DBLP:conf/adbis/99s},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

References

[1]

D. T. Lee, C. K. Wong: Quintary Trees: A File Structure for Multidimensional Database Systems. ACM Trans. Database Syst. 5(3): 339-353(1980) BibTeX

[2]

...

[3]

Michael L. Fredman, Dan E. Willard: Surpassing the Information Theoretic Bound with Fusion Trees. J. Comput. Syst. Sci. 47(3): 424-436(1993) BibTeX

[4]

...

[5]

Peter van Emde Boas: Preserving Order in a Forest in Less Than Logarithmic Time and Linear Space. Inf. Process. Lett. 6(3): 80-82(1977) BibTeX

[6]

Edward A. Fox, Lenwood S. Heath, Qi Fan Chen, Amjad M. Daoud: Practical Minimal Perfect Hash Functions for Large Databases. Commun. ACM 35(1): 105-121(1992) BibTeX