Storing a Sparse Table with 0(1) Worst Case Access Time.

Michael L. Fredman, János Komlós, Endre Szemerédi: Storing a Sparse Table with 0(1) Worst Case Access Time. J. ACM 31(3): 538-544(1984)

@article{DBLP:journals/jacm/FredmanKS84,
  author    = {Michael L. Fredman and
               J{\'a}nos Koml{\'o}s and
               Endre Szemer{\'e}di},
  title     = {Storing a Sparse Table with 0(1) Worst Case Access Time},
  journal   = {J. ACM},
  volume    = {31},
  number    = {3},
  year      = {1984},
  pages     = {538-544},
  ee        = {db/journals/jacm/FredmanKS84.html, http://doi.acm.org/10.1145/828.1884},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

BibTeX

ACM SIGMOD Anthology

CDROM Version: Load the CDROM "Volume 5 Issue 2, JACM, VLDB-J, POS, ..." and ...

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

DVD Version: Load ACM SIGMOD Anthology DVD 2" and ...

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/aDVD2 or /dvd

BibTeX

Online Edition

Citation Page BibTeX

Referenced by

Sergey Brin, Rajeev Motwani, Craig Silverstein: Beyond Market Baskets: Generalizing Association Rules to Correlations. SIGMOD Conference 1997: 265-276
Jun-Ichi Aoe, Katsushi Morimoto, Masami Shishibori, Ki-Hong Park: A Trie Compaction Algorithm for a Large Set of Keys. IEEE Trans. Knowl. Data Eng. 8(3): 476-491(1996)
Vassilis J. Tsotras, B. Gopinath, George W. Hart: Efficient Management of Time-Evolving Databases. IEEE Trans. Knowl. Data Eng. 7(4): 591-608(1995)
Marshall D. Brain, Alan L. Tharp: Using Tries to Eliminate Pattern Collisions in Perfect Hashing. IEEE Trans. Knowl. Data Eng. 6(2): 239-247(1994)
Vassilis J. Tsotras, B. Gopinath: Optimal Versioning of Objects. ICDE 1992: 358-365
Vincent G. Winters: Parallelism For High Performance Query Processing. EDBT 1992: 344-356
Shaibal Roy: Semantic Complexity of Classes of Relational Queries and Query Independent Data Partitioning. PODS 1991: 259-267
Dan E. Willard: Quasilinear Algorithms for Processing Relational Calculus Expressions. PODS 1990: 243-257
Vassilis J. Tsotras, B. Gopinath: Efficient Algorithms for Managing the History of Evolving Databases. ICDT 1990: 141-174
M. V. Ramakrishna: Hashing in Practive, Analysis of Hashing and Universal Hashing. SIGMOD Conference 1988: 191-199

BibTeX