NDLI: Optimizing multiple dimensional queries simultaneously in multidimensional databases

Please wait, while we are loading the content...

Optimizing multiple dimensional queries simultaneously in multidimensional databases

Content Provider	Springer Nature Link
Author	Liang, Weifa Orlowska, Maria E. Yu, Jeffrey X.
Copyright Year	2000
Abstract	Some significant progress related to multidimensional data analysis has been achieved in the past few years, including the design of fast algorithms for computing datacubes, selecting some precomputed group-bys to materialize, and designing efficient storage structures for multidimensional data. However, little work has been carried out on multidimensional query optimization issues. Particularly the response time (or evaluation cost) for answering several related dimensional queries simultaneously is crucial to the OLAP applications. Recently, Zhao et al. first exploited this problem by presenting three heuristic algorithms. In this paper we first consider in detail two cases of the problem in which all the queries are either hash-based star joins or index-based star joins only. In the case of the hash-based star join, we devise a polynomial approximation algorithm which delivers a plan whose evaluation cost is $ O(n^{\epsilon }$ ) times the optimal, where n is the number of queries and $ \epsilon $ is a fixed constant with $0<\epsilon \leq 1$ . We also present an exponential algorithm which delivers a plan with the optimal evaluation cost. In the case of the index-based star join, we present a heuristic algorithm which delivers a plan whose evaluation cost is n times the optimal, and an exponential algorithm which delivers a plan with the optimal evaluation cost. We then consider a general case in which both hash-based star-join and index-based star-join queries are included. For this case, we give a possible improvement on the work of Zhao et al., based on an analysis of their solutions. We also develop another heuristic and an exact algorithm for the problem. We finally conduct a performance study by implementing our algorithms. The experimental results demonstrate that the solutions delivered for the restricted cases are always within two times of the optimal, which confirms our theoretical upper bounds. Actually these experiments produce much better results than our theoretical estimates. To the best of our knowledge, this is the only development of polynomial algorithms for the first two cases which are able to deliver plans with deterministic performance guarantees in terms of the qualities of the plans generated. The previous approaches including that of [ZDNS98] may generate a feasible plan for the problem in these two cases, but they do not provide any performance guarantee, i.e., the plans generated by their algorithms can be arbitrarily far from the optimal one.
Starting Page	319
Ending Page	338
Page Count	20
File Format	PDF
ISSN	10668888
Journal	The VLDB Journal
Volume Number	8
Issue Number	3-4
e-ISSN	0949877X
Language	English
Publisher	Springer-Verlag
Publisher Date	2000-02-01
Publisher Place	Berlin Heidelberg
Access Restriction	One Nation One Subscription (ONOS)
Content Type	Text
Resource Type	Article
Subject	Information Systems Hardware and Architecture

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Optimizing relational queries in connection hypergraphs: nested queries, views, and binding propagations

A graph-theoretic model for optimizing queries involving methods

Selectivity estimators for multidimensional range queries over real attributes

Supporting top-k join queries in relational databases

Heuristics for Optimizing Multi-Clip Queries in Video Databases

Load balanced and optimal disk allocation strategy for partial match queries on multidimensional files

Continuous nearest-neighbor queries with location uncertainty

Efficient processing of top-k dominating queries in distributed environments

Dynamic monitoring of optimal locations in road network databases

Optimizing multiple dimensional queries simultaneously in multidimensional databases

Similar Documents

Optimizing relational queries in connection hypergraphs: nested queries, views, and binding propagations

A graph-theoretic model for optimizing queries involving methods

Selectivity estimators for multidimensional range queries over real attributes

Supporting top-k join queries in relational databases

Heuristics for Optimizing Multi-Clip Queries in Video Databases

Load balanced and optimal disk allocation strategy for partial match queries on multidimensional files

Continuous nearest-neighbor queries with location uncertainty

Efficient processing of top-k dominating queries in distributed environments

Dynamic monitoring of optimal locations in road network databases

Optimizing multiple dimensional queries simultaneously in multidimensional databases