ACM SIGMOD Anthology ACM SIGMOD dblp.uni-trier.de

Efficient Algorithms for Maintenance of Large Database.

Jaideep Srivastava, C. V. Ramamoorthy: Efficient Algorithms for Maintenance of Large Database. ICDE 1988: 402-408
@inproceedings{DBLP:conf/icde/SrivastavaR88,
  author    = {Jaideep Srivastava and
               C. V. Ramamoorthy},
  title     = {Efficient Algorithms for Maintenance of Large Database},
  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     = {402-408},
  ee        = {db/conf/icde/SrivastavaR88.html},
  crossref  = {DBLP:conf/icde/88},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX

Abstract

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


ACM SIGMOD Anthology

CDROM Version: Load the CDROM "Volume 2 Issue 6, ICDE 1984-1995" and ... DVD Version: Load ACM SIGMOD Anthology DVD 1" and ... BibTeX

Printed Edition

Proceedings of the Fourth International Conference on Data Engineering, February 1-5, 1988, Los Angeles, California, USA. IEEE Computer Society 1988, ISBN 0-8186-0827-7
Contents BibTeX

References

[AVL62]
...
[BAY72]
Rudolf Bayer, Edward M. McCreight: Organization and Maintenance of Large Ordered Indices. Acta Inf. 1: 173-189(1972) BibTeX
[BEN79]
Jon Louis Bentley, Jerome H. Friedman: Data Structures for Range Searching. ACM Comput. Surv. 11(4): 397-409(1979) BibTeX
[BRI63]
...
[FIN82]
Sheldon J. Finkelstein: Common Subexpression Analysis in Database Applications. SIGMOD Conference 1982: 235-245 BibTeX
[GHO86]
...
[HOR78]
Ellis Horowitz, Sartaj Sahni: Fundamentals of Computer Algorithms. Computer Science Press 1978
BibTeX
[IBM75]
...
[KNU73]
Donald E. Knuth: The Art of Computer Programming, Volume III: Sorting and Searching. Addison-Wesley 1973, ISBN 0-201-03803-X
BibTeX
[LOH77]
Guy M. Lohman, John A. Muckstadt: Optimal Policy for Batch Operations: Backup, Checkpointing, Reorganization, and Updating. ACM Trans. Database Syst. 2(3): 209-222(1977) BibTeX
[PAL85]
Prashant Palvia: Expressions for Batched Searching of Sequential and Hierarchical Files. ACM Trans. Database Syst. 10(1): 97-106(1985) BibTeX
[SEL86]
Timos K. Sellis: Global Query Optimization. SIGMOD Conference 1986: 191-205 BibTeX
[STO73]
...
[ULL82]
Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman: The Design and Analysis of Computer Algorithms. Addison-Wesley 1974, ISBN 0-201-00029-6
BibTeX

Referenced by

  1. Kerttu Pollari-Malmi, Eljas Soisalon-Soininen, Tatu Ylönen: Concurrency Control in B-Trees with Batch Updates. IEEE Trans. Knowl. Data Eng. 8(6): 975-984(1996)
  2. Jaideep Srivastava, Jack S. Eddy Tan, Vincent Y. Lum: TBSAM: An Access Method for Efficient Processing of Statistical Queries. IEEE Trans. Knowl. Data Eng. 1(4): 414-423(1989)
  3. Jaideep Srivastava, Vincent Y. Lum: A Tree Based Access Method (TBSAM) for Fast Processing of Aggregate Queries. ICDE 1988: 504-510
BibTeX
ACM SIGMOD Anthology - DBLP: [Home | Search: Author, Title | Conferences | Journals]
ICDE Proceedings: Copyright © by IEEE,
ACM SIGMOD Anthology: Copyright © by ACM (info@acm.org), Corrections: anthology@acm.org
DBLP: Copyright © by Michael Ley (ley@uni-trier.de), last change: Sat May 16 23:17:41 2009