This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Expressions for Completely and Partly Unsuccessful Batched Search of Sequential and Tree-Structured Files
June 1989 (vol. 15 no. 6)
pp. 794-799

A number of previous studies derived expressions for batched searching of sequential and tree-structured files on the assumption that all the keys in the batch exist in the file, i.e., all the searches are successful. Formulas for batched searching of sequential and tree-structured files are derived, but the assumption made is that either all or part of the keys in the batch do not exist in the file, i.e., the batched search is completely or partly unsuccessful.

[1] D. E. Knuth,The Art of Computer Programming, Vol. 3, Reading, MA: Addison-Wesley, 1973.
[2] T. J. Teorey and J. R. Fry,Design of Database Structures. Englewood Cliffs, NJ: Prentice-Hall, 1982.
[3] D. W. Shneiderman and V. Goodman, "Batched searching of sequential and tree structured files,"ACM Trans. Database Syst., vol. 1, Sept. 1976.
[4] S. Christodoulakis, "Estimating block transfer and join sizes," inProc. 1983 ACM SIGMOD Conf., San Jose, CA, May 1983, pp. 40-54.
[5] A. Cardenas, "Analysis and performance of inverted data-base structures,"Commun. ACM, vol. 18, no. 5, pp. 253-263, 1975.
[6] P. Palvia and S. T. March, "Approximating block accesses in database organizations,"Inform. Processing Lett., vol. 19, no. 2, pp. 75-79, Aug. 1984.
[7] D. S. Batory and C. C. Gotlieb, "A unifying model of physical databases,"ACM Trans. Database Syst., vol. 10, pp. 97-106, 1982.
[8] P. Palvia, "Expressions for batched searching of sequential and hierarchical files,"ACM Trans. Database Syst., vol. 10, pp. 97-106, Mar. 1985.
[9] S. B. Yao, "An attribute based model for database access cost analysis,"ACM Trans. Database Syst., vol. 2, pp. 45-67, Mar. 1977.
[10] T. Cheung, "Estimating block accesses and number of records in file management,"Commun. ACM, vol. 25, no. 7, pp. 484-487, July 1982.
[11] W. Luk, "On estimating block accesses in database organizations,"Commun. ACM, vol. 26, no. 11, pp. 945-947, Nov. 1983.
[12] K. Whang, G. Wiederhold, and D. Sagalowicz, "Estimating block accesses in database organizations: A closed noniterative formula,"Commun. ACM, vol. 26, no. 11, pp. 940-944, Nov. 1983.
[13] S. B. Yao, "Approximating block accesses in database organizations,"Commun. ACM, vol. 20, pp. 260-261, Apr. 1977.
[14] M. Piwowarski, "Comments on batched searching of sequential and tree-structured files,"ACM Trans. Database Syst., vol. 10, pp. 285- 287, June 1985.
[15] Y. Manolopoulos, J. G. Kollias, and M. Hatzopoulos, "Binary vs. sequential batched search,"Comput. J., vol. 29, pp. 368-372, 1986.
[16] Y. Manolopoulos, L. Petrou, and D. Kleftouris, "Searching for composite queries in a main memory database,"Angewandte Informatik, vol. 84, pp. 141-148, 1987.
[17] Y. Manolopoulos and J. G. Kollias, "Estimating disk head movement in batched search,"BIT, vol. 28, pp. 27-36, 1988.
[18] Y. Manolopoulos and J. G. Kollias, "Performance of a two-headed disk system when serving data-base queries under the SCAN policy,"ACM Trans. Database Syst., 1989.
[19] Y. Manolopoulos, "Probability distributions for seek time evaluation,"Inform. Sci., submitted for publication.

Index Terms:
completely unsuccessful batched search; partly unsuccessful batched search; batched searching; tree-structured files; batch processing (computers); database management systems; information retrieval
Citation:
Y. Manolopoulos, J.G. Kollias, "Expressions for Completely and Partly Unsuccessful Batched Search of Sequential and Tree-Structured Files," IEEE Transactions on Software Engineering, vol. 15, no. 6, pp. 794-799, June 1989, doi:10.1109/32.24732
Usage of this product signifies your acceptance of the Terms of Use.