A Tree Based Access Method (TBSAM) for Fast Processing of Aggregate Queries.

@inproceedings{DBLP:conf/icde/SrivastavaL88,
  author    = {Jaideep Srivastava and
               Vincent Y. Lum},
  title     = {A Tree Based Access Method (TBSAM) for Fast Processing of Aggregate
               Queries},
  booktitle = {Proceedings of the Fourth International Conference on Data Engineering,
               February 1-5, 1988, Los Angeles, California, USA},
  publisher = {IEEE Computer Society},
  year      = {1988},
  isbn      = {0-8186-0827-7},
  pages     = {504-510},
  ee        = {db/conf/icde/SrivastavaL88.html},
  crossref  = {DBLP:conf/icde/88},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Copyright © 1988 by The Institute of Electrical and Electronic Engineers, Inc. (IEEE). Abstract used with permission.

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/An2-6 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

Printed Edition

Journal Version

References

[AVL 62]

...

[BAY 72]

Rudolf Bayer, Edward M. McCreight: Organization and Maintenance of Large Ordered Indices. Acta Inf. 1: 173-189(1972) BibTeX

[BEN 79]

Jon Louis Bentley, Jerome H. Friedman: Data Structures for Range Searching. ACM Comput. Surv. 11(4): 397-409(1979) BibTeX

[COC 53]

William G. Cochran: Sampling Techniques. John Wiley 1953
BibTeX

[DAT 77]

C. J. Date: An Introduction to Database Systems, 2nd Edition. Addison-Wesley 1977
BibTeX

[GHO 86]

...

[GHO 85]

...

[HER 75]

...

[HOR 78]

Ellis Horowitz, Sartaj Sahni: Fundamentals of Computer Algorithms. Computer Science Press 1978
BibTeX

[IBM 75]

...

[KEN 58]

...

[KNU 73]

Donald E. Knuth: The Art of Computer Programming, Volume III: Sorting and Searching. Addison-Wesley 1973, ISBN 0-201-03803-X
BibTeX

[McC 82]

John L. McCarthy: Metadata Management for Large Statistical Databases. VLDB 1982: 234-243 BibTeX

[OLK 86]

Frank Olken, Doron Rotem: Simple Random Sampling from Relational Databases. VLDB 1986: 160-169 BibTeX

[SHO 82]

Arie Shoshani: Statistical Databases: Characteristics, Problems, and some Solutions. VLDB 1982: 208-222 BibTeX

[SRI 88]

Jaideep Srivastava, C. V. Ramamoorthy: Efficient Algorithms for Maintenance of Large Database. ICDE 1988: 402-408 BibTeX

[ULL 82]

...

[ZAD 65]

Lotfi A. Zadeh: Fuzzy Sets. Information and Control 8(3): 338-353(1965) BibTeX

Referenced by

1. Paul M. Aoki: Generalizing ``Search'' in Generalized Search Trees (Extended Abstract). ICDE 1998: 380-389
2. Gennady Antoshenkov: Random Sampling from Pseudo-Ranked B+ Trees. VLDB 1992: 375-382
3. Frank Olken, Doron Rotem: Random Sampling from Database Files: A Survey. SSDBM 1990: 92-111
4. Meng Chang Chen, Lawrence McNamee, Norman S. Matloff: Selectivity Estimation Using Homogeneity Measurement. ICDE 1990: 304-310
5. Meng Chang Chen, Lawrence McNamee: On the Data Model and Access Method of Summary Data Management. IEEE Trans. Knowl. Data Eng. 1(4): 519-529(1989)
6. Frank Olken, Doron Rotem: Random Sampling from B+ Trees. VLDB 1989: 269-277
7. Meng Chang Chen, Lawrence McNamee: A Data Model and Access Method for Summary Data Management. ICDE 1989: 242-249
8. Meng Chang Chen, Lawrence McNamee, Michel A. Melkanoff: A Model of Summary Data and its Applications in Statistical Databases. SSDBM 1988: 356-372