Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Dieter Van de Craen

dblp:25/49 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2008
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 3

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Query processing and optimization · 77% Distributed and cloud data management · 23%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Query processing and optimization › query optimization
distributed query optimization
0.112008
Scalable multi-query optimization for exploratory queries over federated scientific databases · Proc. VLDB Endow. 2008
Query processing and optimization › interactive query processing
exploratory query
0.112008
Scalable multi-query optimization for exploratory queries over federated scientific databases · Proc. VLDB Endow. 2008
Distributed and cloud data management
federated database
0.112008
Scalable multi-query optimization for exploratory queries over federated scientific databases · Proc. VLDB Endow. 2008
Query processing and optimization
multi-query optimization
0.112008
Scalable multi-query optimization for exploratory queries over federated scientific databases · Proc. VLDB Endow. 2008
Query processing and optimization › query planning
query plan generation
0.012008
Scalable multi-query optimization for exploratory queries over federated scientific databases · Proc. VLDB Endow. 2008

Methods — techniques the papers use, named apart from their topics

heuristic algorithm · 0.1NP-hardness analysis · 0.1
YearPublicationVenuePosition
2008 BioScout: a life-science query monitoring system
abstract
Scientific data are available through an increasing number of heterogeneous, independently evolving, sources. Although the sources themselves are independently evolving, the data stored in them are not. There exist inherent and intricate relationships between the distributed data-sets and scientists are routinely required to write distributed queries in this setting. Being non-experts in computer science, the scientists are faced with two major challenges: (i) How to express such distributed queries. This is a non-trivial task, even if we assume that scientists are familiar with query languages like SQL. Such queries can get arbitrarily complex as more sources are considered; (ii) How to efficiently evaluate such distributed queries. An efficient evaluation must account for batches of hundreds (or even thousands) of submitted queries and must optimize all of them as a whole.
Anastasios Kementsietsidis, Frank Neven, Dieter Van de Craen
EDBT3
2008 Scalable multi-query optimization for exploratory queries over federated scientific databases
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 an implementation of our algorithms, along with experiments that illustrate their potential not only for the optimization of exploratory queries, but also for the multiquery optimization of large batches of standard queries.
Anastasios Kementsietsidis, Frank Neven, Dieter Van de Craen, Stijn Vansummeren
Proc. VLDB Endow.3
2006 Optimizing Monitoring Queries over Distributed Data
Frank Neven, Dieter Van de Craen
EDBT2