Optimizing query rewriting for multiple queries

Konstantinidis, George and Ambite, Jose Luis (2012) Optimizing query rewriting for multiple queries. IIWeb '12: Proceedings of the Ninth International Workshop on Information Integration on the Web, , Scottsdale, United States. pp. 1-6 .

Record type: Conference or Workshop Item (Paper)

Abstract

We present an scalable algorithm for answering multiple conjunctive queries using views. This is an important problem in query optimization, data integration and ontology-based data access. Since rewriting one conjunctive query using views is an NP-hard problem, we develop an approach where answering n queries takes less than n times the cost of answering one query, by compactly representing and indexing common patterns in the input queries and the views. Our initial experimental results show a promising speed up.

This record has no associated files available for download.

More information

Published date: 2012

Venue - Dates: IIWeb '12: Proceedings of the Ninth International Workshop on Information Integration on the Web, , Scottsdale, United States, 2012-05-20

Learn more about Web and Internet Science research

Identifiers

Local EPrints ID: 504280

URI: http://eprints.soton.ac.uk/id/eprint/504280

PURE UUID: 0e7b9fb4-7d1d-4a4b-baad-074e323901d4

Catalogue record

Date deposited: 02 Sep 2025 17:08

Last modified: 02 Sep 2025 17:08

Export record

Share this record

Share this on Facebook Share this on Twitter Share this on Weibo

Contributors

Author: George Konstantinidis

Author: Jose Luis Ambite

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Library staff additional information