ACM Home Page
Please provide us with feedback. Feedback
View indexing in relational databases
Full text PdfPdf (1.94 MB)
Source ACM Transactions on Database Systems (TODS) archive
Volume 7 ,  Issue 2  (June 1982) table of contents
Pages: 258 - 290  
Year of Publication: 1982
ISSN:0362-5915
Author
Nicholas Roussopoulos  Univ. of Maryland, College Park
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 68,   Citation Count: 39
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/319702.319729
What is a DOI?

ABSTRACT

The design and maintenance of a useful database system require efficient optimization of the logical access paths which demonstrate repetitive usage patterns. Views (classes of queries given by a query model) are an appropriate intermediate logical representation for database. Frequently accessed views of databases need to be supported by indexing to enhance retrieval. This paper investigates the problem of selecting an optimal index set of views and describes an efficient algorithm for this selection.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
3
 
4
CHnNDY, K.M. Models of distributed systems. In Proc. 3rd Int. Conf. Very Large Databases, Tokyo, Japan, Oct. 6-8, ACM, New York, 1977, pp. 105-120.
 
5
CHANG, S.K. AND CHZNG, W.H. Database skeleton and its application to logical database synthesis. IEEE Trans. Softw. Eng. SE-U, 1 (Jan. 1978), 18-30.
 
6
FARLEY, J.H.G. ASP SCHUS~E~t, S.A. Query execution and index selection for relational data bases. Tech. Rep. CSRG-53, Univ. Toronto, Toronto, Ont., Canada, March 1975.
 
7
JACOBS, B.J. External to conceptual mapping construction using database logic, TR-1012, Dep. Computer Science, Univ. of Maryland, College Park, 1981.
 
8
KaRP, R.M. Reducibility among combinatorial problems. In Complexity of Computer Computations, R.E. Miller and J.W. Thatcher, Eds. pp. 85-104. Plenum, New York, 1972.
 
9
KINO, W.F. On the selection of indices for a file. IBM Research Rep. RJ1341, IBM, San Jose, Calif. 1974.
10
 
11
MYLOPOULOS, J., SCHUSTER, S., A~D TSICHRITZIS, D. A multi-level relational system. In Proc. 1975 Nat. Computer Conf., AFIPS Press, Arlington, Va.
 
12
 
13
 
14
RoussoPouLos, N. CSDL: A language for conceptual schema design. IEEE Trans. Softw. Eng. SE-5, 5 (Sept. 1979), 481-496.
 
14a
RoussoPouLos, N. The logical access path schema of a database. IEEE Trans. Softw. Eng., to appear.
 
15
RoussoPOULOS, N. AND MYLOPOULOS, J. Using semantic networks for data base management. In Proc. Ist Int. Conf. Very Large Data Bases, Framingham, Mass., 1975, pp.144-172.
16
17
 
18
SCHKOLNICK, M. Physical database design techniques. In Proc. NYU Syrup. Database Design, New York, 1978, pp. 99-109.
19
20

CITED BY  39
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Collaborative Colleagues:
Nicholas Roussopoulos: colleagues

Peer to Peer - Readers of this Article have also read: