An algorithm for answering queries efficiently using views

P. Mitra

Research output: Chapter in Book/Report/Conference proceedingConference contribution

29 Citations (Scopus)

Abstract

Algorithms for answering queries using views have been used in query planning in order to answer queries posed to knowledge bases, databases, and information systems. However, these algorithms do not scale well when the number of views increases. Three known algorithms, the bucket algorithm, the inverse-rules algorithm and an algorithm suggested by Leser (1998) have been used to rewrite queries using views before executing the queries. The bucket algorithm, predominantly used to reformulate queries, generates a candidate rewriting to a query using views, and checks that the rewriting is contained in the original query. An exponential conjunctive-query-containment-test needs to be performed to check each candidate rewriting. Using a few extra a buckets (shared-variable-buckets), we show how we can avoid the conjunctive-query-containment-test. This paper presents a scalable query rewriting algorithm-the shared-variable-bucket (SVB) algorithm. Experimental results demonstrate its superiority over other known algorithms.

Original languageEnglish
Title of host publicationProceedings - 12th Australasian Database Conference, ADC 2001
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages99-106
Number of pages8
ISBN (Print)0769509665, 9780769509662
DOIs
Publication statusPublished - 2001
Externally publishedYes
Event12th Australasian Database Conference, ADC 2001 - Gold Coast, Australia
Duration: 29 Jan 20011 Feb 2001

Other

Other12th Australasian Database Conference, ADC 2001
CountryAustralia
CityGold Coast
Period29/1/011/2/01

Fingerprint

Information systems
Planning

ASJC Scopus subject areas

  • Hardware and Architecture
  • Information Systems
  • Software

Cite this

Mitra, P. (2001). An algorithm for answering queries efficiently using views. In Proceedings - 12th Australasian Database Conference, ADC 2001 (pp. 99-106). [904470] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ADC.2001.904470

An algorithm for answering queries efficiently using views. / Mitra, P.

Proceedings - 12th Australasian Database Conference, ADC 2001. Institute of Electrical and Electronics Engineers Inc., 2001. p. 99-106 904470.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Mitra, P 2001, An algorithm for answering queries efficiently using views. in Proceedings - 12th Australasian Database Conference, ADC 2001., 904470, Institute of Electrical and Electronics Engineers Inc., pp. 99-106, 12th Australasian Database Conference, ADC 2001, Gold Coast, Australia, 29/1/01. https://doi.org/10.1109/ADC.2001.904470
Mitra P. An algorithm for answering queries efficiently using views. In Proceedings - 12th Australasian Database Conference, ADC 2001. Institute of Electrical and Electronics Engineers Inc. 2001. p. 99-106. 904470 https://doi.org/10.1109/ADC.2001.904470
Mitra, P. / An algorithm for answering queries efficiently using views. Proceedings - 12th Australasian Database Conference, ADC 2001. Institute of Electrical and Electronics Engineers Inc., 2001. pp. 99-106
@inproceedings{b093c87574b743a0ae512eef7647897c,
title = "An algorithm for answering queries efficiently using views",
abstract = "Algorithms for answering queries using views have been used in query planning in order to answer queries posed to knowledge bases, databases, and information systems. However, these algorithms do not scale well when the number of views increases. Three known algorithms, the bucket algorithm, the inverse-rules algorithm and an algorithm suggested by Leser (1998) have been used to rewrite queries using views before executing the queries. The bucket algorithm, predominantly used to reformulate queries, generates a candidate rewriting to a query using views, and checks that the rewriting is contained in the original query. An exponential conjunctive-query-containment-test needs to be performed to check each candidate rewriting. Using a few extra a buckets (shared-variable-buckets), we show how we can avoid the conjunctive-query-containment-test. This paper presents a scalable query rewriting algorithm-the shared-variable-bucket (SVB) algorithm. Experimental results demonstrate its superiority over other known algorithms.",
author = "P. Mitra",
year = "2001",
doi = "10.1109/ADC.2001.904470",
language = "English",
isbn = "0769509665",
pages = "99--106",
booktitle = "Proceedings - 12th Australasian Database Conference, ADC 2001",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - An algorithm for answering queries efficiently using views

AU - Mitra, P.

PY - 2001

Y1 - 2001

N2 - Algorithms for answering queries using views have been used in query planning in order to answer queries posed to knowledge bases, databases, and information systems. However, these algorithms do not scale well when the number of views increases. Three known algorithms, the bucket algorithm, the inverse-rules algorithm and an algorithm suggested by Leser (1998) have been used to rewrite queries using views before executing the queries. The bucket algorithm, predominantly used to reformulate queries, generates a candidate rewriting to a query using views, and checks that the rewriting is contained in the original query. An exponential conjunctive-query-containment-test needs to be performed to check each candidate rewriting. Using a few extra a buckets (shared-variable-buckets), we show how we can avoid the conjunctive-query-containment-test. This paper presents a scalable query rewriting algorithm-the shared-variable-bucket (SVB) algorithm. Experimental results demonstrate its superiority over other known algorithms.

AB - Algorithms for answering queries using views have been used in query planning in order to answer queries posed to knowledge bases, databases, and information systems. However, these algorithms do not scale well when the number of views increases. Three known algorithms, the bucket algorithm, the inverse-rules algorithm and an algorithm suggested by Leser (1998) have been used to rewrite queries using views before executing the queries. The bucket algorithm, predominantly used to reformulate queries, generates a candidate rewriting to a query using views, and checks that the rewriting is contained in the original query. An exponential conjunctive-query-containment-test needs to be performed to check each candidate rewriting. Using a few extra a buckets (shared-variable-buckets), we show how we can avoid the conjunctive-query-containment-test. This paper presents a scalable query rewriting algorithm-the shared-variable-bucket (SVB) algorithm. Experimental results demonstrate its superiority over other known algorithms.

UR - http://www.scopus.com/inward/record.url?scp=84964547570&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84964547570&partnerID=8YFLogxK

U2 - 10.1109/ADC.2001.904470

DO - 10.1109/ADC.2001.904470

M3 - Conference contribution

AN - SCOPUS:84964547570

SN - 0769509665

SN - 9780769509662

SP - 99

EP - 106

BT - Proceedings - 12th Australasian Database Conference, ADC 2001

PB - Institute of Electrical and Electronics Engineers Inc.

ER -