Demo Data from VLDB 2026 / reviewers in the wild / expert
Oliver M. Duschka
dblp:d/OMDuschka
· DBLP profile ↗
4ranked-venue papers
2as first author
0since 2021 · last 1998
0009-0003-4328-6125ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 3 · 1 first-authorArtificial intelligence and machine learning · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author
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
3 papers |
Query processing and optimization · 54% Data integration and cleaning · 23% Data models and query languages · 17% | |
| Artificial intelligence
1 paper |
Planning, search and constraint satisfaction · 87% Multi-agent systems · 13% |
Topics — the 7 heaviest of 9, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Query processing and optimization › query rewriting
query answering using views |
0.0 | 2 | 1998 | Complexity of Answering Queries Using Materialized Views · PODS 1998 Answering Recursive Queries Using Views · PODS 1997 |
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › planning under uncertainty
information gathering |
0.0 | 1 | 1997 | Recursive Plans for Information Gathering · IJCAI (1) 1997 |
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › hierarchical planning
recursive planning |
0.0 | 1 | 1997 | Recursive Plans for Information Gathering · IJCAI (1) 1997 |
Data models and query languages
datalog |
0.0 | 1 | 1997 | Answering Recursive Queries Using Views · PODS 1997 |
Query processing and optimization
datalog rewriting |
0.0 | 1 | 1997 | Answering Recursive Queries Using Views · PODS 1997 |
Data integration and cleaning
data warehouse |
0.0 | 1 | 1998 | Complexity of Answering Queries Using Materialized Views · PODS 1998 |
Knowledge, reasoning and agents › Multi-agent systems
distributed problem solving |
0.0 | 1 | 1997 | Recursive Plans for Information Gathering · IJCAI (1) 1997 |
Methods — techniques the papers use, named apart from their topics
datalog · 0.0first-order logic · 0.0conjunctive queries · 0.0materialized views · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1998 | Complexity of Answering Queries Using Materialized ViewsabstractWC study the complexity of the problem of answering queries using materinlized views, This problem has attracted a lot of attention recently because of its relevance in data integration.Previous work considered only conjunctive view definitions.We examine the consequences of allowing more expressive view definition languages.Tl~olanguagcsweconsiderforviewdefinitionsanduserqueriesare: conjunctive qucrics with inequality, positive queries, datalog, and first-order logic.We show that the complexity of the problem depcnds on whether views are assumed to store all the tuples that satisfy the view definition, or only a subset of it.Finally, we apply the results to the view consistency and view self-maintainability problems which nrise in data warehousing. Serge Abiteboul, Oliver M. Duschka |
PODS | 2 |
| 1997 | Recursive Plans for Information Gathering
Oliver M. Duschka, Alon Y. Halevy |
IJCAI (1) | 1 |
| 1997 | Answering Recursive Queries Using ViewsabstractWe consider the problem of answering datalog queries using materialized views.The abiity to answer queries using views is crucial in the context of information integration.Previous work on answering queries using views restricted queries to being conjunctive.We extend this work to general recursive queries:Given a datalog program P and a set of views, is it possible to find a datalog program that is equivalent to P and only uses views as EDB predicates?In this paper, we show that the problem of whether a datalog program can be rewritten into an equivalent program that only uses views is undecidable.On the other hand, we prove that a datalog program P can be effectively rewritten into a program that only uses views, that is contained in P, and that contains all programs that only use views and are contained in P. As a consequence, if there exists a program equivalent to 'P that only uses views, then our construction is guaranteed to yield a program equivalent to P. Oliver M. Duschka, Michael R. Genesereth |
PODS | 1 |
| 1997 | Infomaster: An Information Integration SystemabstractInfomaster is an information integration system that provides integrated access to multiple distributed heterogeneous information sources on the Internet, thus giving the illusion of a centralized, homogeneous information system. We say that Infomaster creates a virtual data warehouse. The core of Infomaster is a facilitator that dynamically determines an efficient way to answer the user's query using as few sources as necessary and harmonizes the heterogeneities among these sources. Infomaster handles both structural and content translation to resolve differences between multiple data sources and the multiple applications for the collected data. Infomaster connects to a variety of databases using wrappers, such as for Z39.50, SQL databases through ODBC, EDI transactions, and other World Wide Web (WWW) sources. There are several WWW user interfaces to Infomaster, including forms based and textual. Infomaster also includes a programmatic interface and it can download results in structured form onto a client computer. Infomaster has been in production use for integrating rental housing advertisements from several newspapers (since fall 1995), and for meeting room scheduling (since winter 1996). Infomaster is also being used to integrate heterogeneous electronic product catalogs. Michael R. Genesereth, Arthur M. Keller, Oliver M. Duschka |
SIGMOD Conference | 3 |