Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/9103
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | VAN DE CRAEN, Dieter | - |
dc.contributor.author | NEVEN, Frank | - |
dc.contributor.author | VANSUMMEREN, Stijn | - |
dc.contributor.author | KEMENTSIETSIDIS, Anastasios | - |
dc.date.accessioned | 2009-01-08T13:49:01Z | - |
dc.date.available | 2009-01-08T13:49:01Z | - |
dc.date.issued | 2008 | - |
dc.identifier.citation | Jagadish, H. V. (Ed.) Proceedings of the VLDB Endowment: vol. 1. p. 16-27. | - |
dc.identifier.uri | http://hdl.handle.net/1942/9103 | - |
dc.description.abstract | The diversity and large volumes of data processed in the Natural Sciences today has led to a proliferation of highly-specialized and autonomous scientific databases with inherent and often intricate relationships. As a user-friendly method for querying this complex, ever-expanding network of sources for correlations, we propose exploratory queries. Exploratory queries are loosely-structured, hence requiring only minimal user knowledge of the source network. Evaluating an exploratory query usually involves the evaluation of many distributed queries. As the number of such distributed queries can quickly become large, we attack the optimization problem for exploratory queries by proposing several multi-query optimization algorithms that compute a global evaluation plan while minimizing the total communication cost, a key bottleneck in distributed settings. The proposed algorithms are necessarily heuristics, as computing an optimal global evaluation plan is shown to be NP-hard. Finally, we present BioScout, an implementation of our algorithms, along with experiments that illustrate their potential not only for the optimization of exploratory queries, but also for the multi-query optimization of large batches of standard queries. | - |
dc.language.iso | en | - |
dc.publisher | VLDB Endowment | - |
dc.subject.other | Query Optimization · Scientific Databases · Distributed Queries | - |
dc.title | Scalable Multi-Query Optimization for Exploratory Queries over Federated Scientific Databases | - |
dc.type | Proceedings Paper | - |
dc.bibliographicCitation.bvolume | 1 | - |
local.bibliographicCitation.authors | Jagadish, H. V. | - |
local.bibliographicCitation.conferencename | International Conference on Very Large Data Bases | - |
dc.bibliographicCitation.conferencenr | 34 | - |
local.bibliographicCitation.conferenceplace | Auckland, New-Zealand, 23-28 August, 2008 | - |
dc.identifier.epage | 27 | - |
dc.identifier.spage | 16 | - |
local.bibliographicCitation.jcat | C2 | - |
local.type.specified | Proceedings Paper | - |
dc.bibliographicCitation.oldjcat | C2 | - |
dc.identifier.url | http://doi.acm.org/10.1145/1453856.1453864 | - |
local.bibliographicCitation.btitle | Proceedings of the VLDB Endowment | - |
item.accessRights | Open Access | - |
item.fullcitation | VAN DE CRAEN, Dieter; NEVEN, Frank; VANSUMMEREN, Stijn & KEMENTSIETSIDIS, Anastasios (2008) Scalable Multi-Query Optimization for Exploratory Queries over Federated Scientific Databases. In: Jagadish, H. V. (Ed.) Proceedings of the VLDB Endowment: vol. 1. p. 16-27.. | - |
item.fulltext | With Fulltext | - |
item.contributor | VAN DE CRAEN, Dieter | - |
item.contributor | NEVEN, Frank | - |
item.contributor | VANSUMMEREN, Stijn | - |
item.contributor | KEMENTSIETSIDIS, Anastasios | - |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
VLDB-2008-ExpQueries.pdf | Published version | 614.62 kB | Adobe PDF | View/Open |
Page view(s)
48
checked on Sep 7, 2022
Download(s)
186
checked on Sep 7, 2022
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.