This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
TBSAM: An Access Method for Efficient Processing of Statistical Queries
December 1989 (vol. 1 no. 4)
pp. 414-423

The domain of statistical and scientific databases is targeted here, and the class of aggregate queries which are very often encountered in this domain is considered. Such a query is aimed at retrieving some aggregate characteristics of the raw data. The tree-based statistics access method (TBSAM), which provides support for the efficient processing of aggregate queries, is presented. It is related to the B/sup tree and also processes the B/sup tree's efficient update properties. Complementing TBSAM is the provision of a grouped update algorithm for minimizing expensive indexed database updates.

[1] IBM Manual, "System 360 operating system, index sequential access methods (programming logic)," Form Y28-6618.
[2] R. Bayer and C. McCreight, "Organization and maintenance of large ordered indexes,"Acta Inform., vol. 1, no. 3, pp. 173-189, 1972.
[3] J. Nieverglt, H. Hinterberger, and K. Sevcik, "The grid file: An adaptable, symmetric multikey file structure,"ACM TODS, Mar. 1984.
[4] W. Litwin, "Linear hashing: A new tool for file and table addressing," inProc. 6th Int. Conf. VLDB, 1980.
[5] M. Freeston, "The bang file: A new kind of grid file," inProc. ACM SIGMOD Int. Conf. Management Data, May 1987, pp. 260-269.
[6] H. Guttman, "R-trees: A dynamic index structure for spatial searching," inProc. ACM/SIGMOD Conf., 1984, pp. 47-56.
[7] H. Samet, "The quadtree and related hierarchical data structures,"Comput. Surveys, vol. 16, pp. 187-260, 1984.
[8] A. Klug, "Equivalence of Relational Algebra and Relational Calculus Query Languages Having Aggregate Functions,"J. ACM, Vol. 29, No. 3, July 1982, pp. 699-717.
[9] S. P. Ghosh, "SIAM: Statistics information access method,"IBM Res. Rep., RJ 4865 (51295).
[10] F. Olken, "Physical database support for scientific and statistical database management," inProc. 3rd Int. Workshop Statist. Sci. Data-base Management, Luxembourg, July 22-24, 1986.
[11] A. Shoshani, "Statistical databases: Characteristics, problems, and some solutions," inProc. 8th Int. Conf. Very Large Data Bases, Mexico City, Mexico, 1982, pp. 208-222.
[12] C. Comer, "The ubiquitousB-trees,"ACM Comput. Surveys, vol. 11, no. 2, pp. 121-136, June 1979.
[13] D. W. Shneiderman and V. Goodman, "Batched searching of sequential and tree structured files,"ACM Trans. Database Syst., vol. 1, Sept. 1976.
[14] P. Palvia, "Expressions for batched searching of sequential and hierarchical files,"ACM Trans. Database Syst., vol. 10, pp. 97-106, Mar. 1985.
[15] M. Piwowarski, "Comments on batched searching of sequential and tree-structured files,"ACM Trans. Database Syst., vol. 10, pp. 285- 287, June 1985.
[16] D. S. Batory, "A model of transactions on physical databases,"ACM Trans. Database Syst., vol. 7, no. 4, pp. 509-539, Dec. 1982.
[17] W. G. Cochran,Sampling Techniques. New York: Wiley, 1953.
[18] F. Olken and D. Rotem, "Simple random sampling from relational databases," inProc. Int Conf. VLDB, Aug. 1986.
[19] D. E. Knuth,The Art of Computer Programming, Vol. 3, Reading, MA: Addison-Wesley, 1973.
[20] M. Stonebraker, "Operating System Support for Database Management,"Comm. ACM, Vol. 24, No. 7, July 1981, pp. 412- 418.
[21] G. Sacco and M. Schkolnick, "A mechanism for managing the buffer pool in a relational database system using the hot set model," inVLDB Conf. Proc., Mexico City, Mexico, 1982, pp. 257-262.
[22] H.-T. Chou and D. J. Dewitt, "An evaluation of buffer management strategies for relational database systems," inProc. 11th Int. Conf. VLDB, Stockholm, Sept. 1985.
[23] J. Srivastava and C. V. Ramamoorthy, "Efficient algorithms for maintenance of large database indexes," inProc. 4th Int. Conf. Data Eng., Los Angeles, CA, Feb. 1988.
[24] D. Severance, "Differential files: their application to the maintenance of large databases,"ACM Trans. Data Base Syst., vol. 1, pp. 256-267, 1976.
[25] S. B. Yao, "Approximating block accesses in database organizations,"Commun. ACM, vol. 20, pp. 260-261, Apr. 1977.

Index Terms:
TBSAM; access method; statistical queries; scientific databases; tree-based statistics access method; database management systems; information retrieval; trees (mathematics)
Citation:
J. Srivastava, J.S.E. Tan, V.Y. Lum, "TBSAM: An Access Method for Efficient Processing of Statistical Queries," IEEE Transactions on Knowledge and Data Engineering, vol. 1, no. 4, pp. 414-423, Dec. 1989, doi:10.1109/69.43417
Usage of this product signifies your acceptance of the Terms of Use.