This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Efficient Expressions for Completely and Partly Unsuccessful Batched Search of Tree-Structured Files
December 1990 (vol. 16 no. 12)
pp. 1433-1435

Closed-form, nonrecurrent expressions for the cost of completely and partly unsuccessful batched searching are developed for complete j-ary tree files. These expressions are applied to both the replacement and nonreplacement models of the search queries. The expressions provide more efficient formulas than previously reported for calculating the cost of batched searching. The expressions can also be used to estimate the number of block accesses for hierarchical file structures.

[1] P. A. Bernstein, N. Goodman, E. Wong, G. L. Reeve, and J. Rothmie, "Query processing in a system for distributed database (SDD-I),"ACM Trans. Database Syst., vol. 6, Dec. 1981.
[2] A. Cardenas, "Analysis and performance of inverted data-base structures,"Commun. ACM, vol. 18, no. 5, pp. 253-263, 1975.
[3] T. Cheung, "Estimating block accesses and number of records in file management,"Commun. ACM, vol. 25, no. 7, pp. 484-487, July 1982.
[4] S. Christodoulakis, "Implications of certain assumptions in database performance evaluation,"ACM Trans. Database Syst.vol. 9, no. 2, pp. 163-186, June 1984.
[5] C. Comer, "The ubiquitousB-trees,"ACM Comput. Surveys, vol. 11, no. 2, pp. 121-136, June 1979.
[6] W. Feller,An Introduction to Probability Theory and its Applications; Vol. I, 2nd ed. New York: Wiley, 1957, pp. 28-32.
[7] S. D. Lang, J. R. Driscoll, and J. H. Jou, "Batch insertion for tree structured file organizations--Improving differential database representation,"Inform. Syst., vol. 11, no. 2, pp. 167-175, June 1986.
[8] S. D. Lang, J. R. Driscoll, and J. H. Jou, "A unified analysis of batched searching of sequential and tree-structured files,"ACM Trans. Database Syst., vol. 14, no. 4, pp. 604-618, Dec. 1989.
[9] G. M. Lohman, C. Mohan, L. M. Haas, B. G. Lindsay, P. G. Selinger, P. F. Wilms, and D. Daniels, "Query processing in R*," inQuery Processing in Database Systems, Kim, Batory, and Reiner, Eds. New York: Springer-Verlag, 1985, pp. 31-47.
[10] L. F. Mackert and G. M. Lohman, "Index scans using a finite LRU buffer: A validated I/O model,"ACM Trans. Database Syst., vol. 14, no. 3, pp. 401-424, Sept. 1989.
[11] Y. Manolopoulos and J. G. Kollias, "Expressions for completely and partly unsuccessful batched search of sequential and tree-structured files,"IEEE Trans. Software Eng., vol. 15, no. 6, pp. 794-799, June 1989.
[12] P. Palvia, "Expressions for batched searching of sequential and hierarchical files,"ACM Trans. Database Syst., vol. 10, pp. 97-106, Mar. 1985.
[13] M. Piwowarski, "Comments on batched searching of sequential and tree-structured files,"ACM Trans. Database Syst., vol. 10, pp. 285- 287, June 1985.
[14] N. Roussopoulos and H. Kang, "Principles and techniques in the design of ADMS±,"computer, vol. 19, no. 12, Dec. 1986.
[15] P. Selinger,et al., "Access path selection in a relational data base system," inProc. 1979 ACM-SIGMOD Int. Conf. Management of Data, Boston, MA, June 1979.
[16] D. W. Shneiderman and V. Goodman, "Batched searching of sequential and tree structured files,"ACM Trans. Database Syst., vol. 1, Sept. 1976.
[17] T. J. Teorey and J. R. Fry,Design of Database Structures. Englewood Cliffs, NJ: Prentice-Hall, 1982.
[18] B. T. Vander Zanden, H. M. Taylor, and D. Bitton, "A general framework for computing block accesses,"Inform. Syst., vol. 12, no. 2, pp. 177-190, 1987.
[19] S. B. Yao, "Approximating block accesses in database organizations,"Commun. ACM, vol. 20, pp. 260-261, Apr. 1977.

Index Terms:
nonrecurrent expressions; partly unsuccessful batched searching; complete j-ary tree files; nonreplacement models; search queries; block accesses; hierarchical file structures; batch processing (computers); data structures; database management systems; information retrieval systems; search problems; trees (mathematics)
Citation:
S.D. Lang, Y. Manolopoulos, "Efficient Expressions for Completely and Partly Unsuccessful Batched Search of Tree-Structured Files," IEEE Transactions on Software Engineering, vol. 16, no. 12, pp. 1433-1435, Dec. 1990, doi:10.1109/32.62451
Usage of this product signifies your acceptance of the Terms of Use.