ACM SAC · 1997

Query Planning in Infomaster

An overview of the query processing method behind Infomaster — the first system to handle arbitrary positive relational algebra queries and source descriptions.

Abstract

Infomaster is an information integration system. It provides integrated access to distributed, heterogeneous information sources, thus giving its users the illusion of a centralized, homogeneous information system. Infomaster is the first such system that is able to handle arbitrary positive relational algebra user queries and database descriptions. It is able efficiently to use integrity constraints and local completeness information for optimization. The system has been deployed in a wide variety of application areas, including engineering, logistics, and electronic commerce. This article provides a much requested overview of the query processing method used by Infomaster.

Publication details

Venue
ACM Symposium on Applied Computing
Year
1997
Authors
Oliver M. Duschka, Michael R. Genesereth
Pages
109–111
Citations
153 Google Scholar, August 2026
DOI
10.1145/331697.331719

Cite this paper

@inproceedings{duschka1997planning,
  author    = {Oliver M. Duschka and Michael R. Genesereth},
  title     = {Query Planning in Infomaster},
  booktitle = {Proceedings of the ACM Symposium on Applied Computing (SAC)},
  pages     = {109--111},
  year      = {1997},
  doi       = {10.1145/331697.331719}
}

Elsewhere