This Article 
 Bibliographic References 
 Add to: 
Selection of Indexes to Memory-Resident Entities for Semantic Data
June 1989 (vol. 1 no. 2)
pp. 274-284

A variation of the index selection problem for an extended relational model when all encoding of information is memory resident is discussed. The data model is the relational model extended in two ways that are common with semantic data models. One consequence of memory residence is that the search space of possible indexes is enlarged to the extent that previous methods requiring some consideration of each possibility are no longer possible. An instance of the index selection problem that includes a set of partial match queries in addition to the input schema is given. It is assumed that the set is determined by an initial phase of query optimization when applied to a fixed set of more general forms of queries that characterize the way in which information is accessed for an application. An initial choice of indexes is made, only considering their suitability for answering the partial match queries.

[1] ADAPLEX: Rational and Reference Manual, Computer Corporation of America CCA-83-08, May 1983.
[2] A. Albano, L. Cardelli, and R. Orsini, "Galileo: A Strongly Typed, Interactive Conceptual Language,"ACM Trans. Database Systems, Vol. 10, No. 2, June 1985, pp. 230-260.
[3] M. P. Atkinson, P. J. Bailey, K. J. Chisholm, P. W. Cockshott, and R. Morrison, "An approach to persistent programming,"Comput. J., vol. 26, pp. 360-365, 1983.
[4] D. R. Barstow,Knowledge Based Program Construction. Amsterdam, The Netherlands: North-Holland, 1979.
[5] S. Ceri and S. Crespi-Reghezzi, "Relational databases in the design of program construction systems,"ACM SIGPLAN Notices, vol. 18, pp. 34-44, Nov. 1983.
[6] D. D. Chamberlin, M. M. Astrahan, K. P. Eswaran, P. Griffiths, R. A. Lorie, J. W. Mehl, P. Reisner, and B. W. Wade, "SEQUEL 2: A unified approach to data definition, manipulation, and control,"IBM J. Res. Development, vol. 20, pp. 560-575, Nov. 1976.
[7] E. F. Codd, "Extending the relational database model to capture more meaning,"ACM Trans. Database Syst., vol. 4, no. 4, pp. 397-434, Dec. 1979.
[8] J. H. G. Farley and S. A. Schuster, "Query execution and index selection for relational data bases," Comput. Syst. Res. Inst., Univ. Toronto, Toronto, Ont., Canada, Tech. Rep. CSRG-53, Mar. 1975.
[9] L. R. Jr. Ford and D. R. Fulkerson,Flows in Networks. Princeton, NJ: Princeton University Press, 1962.
[10] M. Hammer and A. Chan, "Index selection in a self-adaptive database management system," inProc. 1976 ACM-SIGMOD Conf.(Washington, DC).
[11] G. D. Held, M. R. Stonebraker, and E. Wong, "INGRES--A relational data base system,"Proc. Nat. Comput. Conf., vol. 44, 1975.
[12] R. M. Karp, "Reducibility among combinatorial problems," inComplexity of Computer Computation, R. E. Miller and J. W. Thatcher, Eds. New York: Plenum, 1972.
[13] W. Kent, "Limitations of Record-Based Information Models,"ACM Trans. on Database Sys., Vol. 4:1, pp. 107-131.
[14] D. E. Knuth,The Art of Computer Programming, Vol. 3, Reading, MA: Addison-Wesley, 1973.
[15] D.A. Lamb, "IDL: Sharing intermediate representations,"ACM Trans. Program. Lang. Syst., vol. 9, no. 3, pp. 297-318, July 1987.
[16] M. A. Linton, "ImpIementing relational views of programs," inSIGSOFT/SIGPLAN Software Engineering Symp. Practical Software Development Environments, Pittsburgh, PA, Apr. 1984, pp. 132-140, see alsoSIGSOFT Software Eng. Notes, vol. 9, no. 3, May 1984; see alsoSIGPLAN Notices, vol. 19, no. 5, May 1984.
[17] J. R. Low, "Automatic data structure selection: an example and overview,"Commun. ACM, vol. 21, pp. 376-385, May 1978.
[18] J. Mylopoulos,et al., "A language facility for designing database intensive applications,"ACM Trans. Database Syst., vol. 5, no. 2, June 1980.
[19] M. L. Powell and M. A. Linton, "A database model of debugging," inProc. ACM SIGSOFT/SIGPLAN Software Symp. High-Level Debugging, Aug. 1983, pp. 67-70.
[20] M. Schkolnick, "The optimal selection of secondary indices for files,"Inform. Syst., vol. 1, pp. 27-44, Mar. 1977.
[21] E. Schonberg, J. Schwartz, and M. Sharir, "An automatic technique for the selection of data representations in SETL programs,"ACM Trans. Program. Lang. Syst., vol. 3, no. 2, pp. 126-143, Apr. 1981.
[22] J. M. Smith and D. C. P. Smith, "A database approach to software specification, Computer Corporation of America, Tech. Rep. 17, 1979.
[23] T. J. Teorey and J. R. Fry,Design of Database Structures. Englewood Cliffs, NJ: Prentice-Hall, 1982.
[24] F. W. Tompa and R. J. Ramirez, "An aid for the selection of efficient storage structures,"INFOR, vol. 21, pp. 206-229, Aug. 1983.
[25] G. E. Weddell, "Physical design and query compilation for a semantic data model (assuming memory residence)," Comput. Syst. Res. Inst., Univ. Toronto, Toronto, Ont., Canada, Tech. Rep. 198, 1987.
[26] G. E. Weddell, "Reasoning about functional dependencies generalized for semantic data models," Dep. Comput. Sci., Univ. Waterloo, Waterloo, Ont., Canada, Res. Rep. CS-89-14.
[27] C. Zaniolo, "The database language GEM," inProc. 1983 ACMSIGMOD Int. Conf. Management of Data, San Jose, CA, May 1983.

Index Terms:
information encoding; indexes; memory-resident entities; semantic data models; index selection problem; extended relational model; search space; partial match queries; input schema; query optimization; information retrieval; relational databases
G.E. Weddell, "Selection of Indexes to Memory-Resident Entities for Semantic Data," IEEE Transactions on Knowledge and Data Engineering, vol. 1, no. 2, pp. 274-284, June 1989, doi:10.1109/69.87966
Usage of this product signifies your acceptance of the Terms of Use.