Treffer: Density-based view materialization

Title:
Density-based view materialization
Source:
Pattern recognition and machine intelligence (First international conference, PReMI 2005, Kolkata, India, December 20-22, 2005)0PReMI 2005. :589-594
Publisher Information:
Berlin: Springer, 2005.
Publication Year:
2005
Physical Description:
print, 9 ref 1
Original Material:
INIST-CNRS
Document Type:
Konferenz Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Department of Information Technology, Tezpur University, Napaam 784 028, India
ISSN:
0302-9743
Rights:
Copyright 2006 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.17480521
Database:
PASCAL Archive

Weitere Informationen

View materialization or pre-computation of aggregates(views) is a well known technique used in data warehouse design and Decision Support System(DSS) to reduce the query response time. Obviously, all the views cannot be materialized due to space-time constraint. So, one important decision in designing Data Warehouse and DSS is to select the views to be materialized, which will reduce the query response time to the minimum limit in a DSS. This paper presents a density-based view materialization algorithm with average runtime complexity O(nlogn), where n is the number of views. We have used data cube lattice, view size, access frequency of the views and support(frequency) of the views in selecting the views to be materialized. Our algorithm works much faster and selects better views than other existing algorithms.