ACM SIGMOD Anthology TODS dblp.uni-trier.de

Resolving the Query Inference Problem Using Steiner Trees.

Joseph A. Wald, Paul G. Sorenson: Resolving the Query Inference Problem Using Steiner Trees. ACM Trans. Database Syst. 9(3): 348-368(1984)
@article{DBLP:journals/tods/WaldS84,
  author    = {Joseph A. Wald and
               Paul G. Sorenson},
  title     = {Resolving the Query Inference Problem Using Steiner Trees},
  journal   = {ACM Trans. Database Syst.},
  volume    = {9},
  number    = {3},
  year      = {1984},
  pages     = {348-368},
  ee        = {http://doi.acm.org/10.1145/1270.1275, db/journals/tods/WaldS84.html},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX

Abstract

The query inference problem is to translate a sentence of a query language into an unambiguous representation of a query. A query is represented as an expression over a set of query trees. A metric is introduced for measuring the complexity of a query and also a proposal that a sentence be translated into the least complex query which "satisfies" the sentence. This method of query inference can be used to resolve ambiguous sentences and leads to easier formulation of sentences.

Copyright © 1984 by the ACM, Inc., used by permission. Permission to make digital or hard copies is granted provided that copies are not made or distributed for profit or direct commercial advantage, and that copies show this notice on the first page or initial screen of a display along with the full citation.


Joint ACM SIGMOD / IEEE Computer Society Anthology

CDROM Version: Load the CDROM "Volume 3 Issue 1, TODS 1976-1990" and ... DVD Version: Load ACM SIGMOD Anthology DVD 2" and ... BibTeX

References

[1]
Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman: The Design and Analysis of Computer Algorithms. Addison-Wesley 1974, ISBN 0-201-00029-6
BibTeX
[2]
Catriel Beeri, Henry F. Korth: Compatible Attributes in a Universal Relation. PODS 1982: 55-62 BibTeX
[3]
Philip A. Bernstein, Dah-Ming W. Chiu: Using Semi-Joins to Solve Relational Queries. J. ACM 28(1): 25-40(1981) BibTeX
[4]
Philip A. Bernstein, Nathan Goodman: Power of Natural Semijoins. SIAM J. Comput. 10(4): 751-771(1981) BibTeX
[5]
...
[6]
Peter P. Chen: The Entity-Relationship Model - Toward a Unified View of Data. ACM Trans. Database Syst. 1(1): 9-36(1976) BibTeX
[7]
...
[8]
Ronald Fagin, Alberto O. Mendelzon, Jeffrey D. Ullman: A Simplified Universal Relation Assumption and Its Properties. ACM Trans. Database Syst. 7(3): 343-360(1982) BibTeX
[9]
M. R. Garey, David S. Johnson, Larry J. Stockmeyer: Some Simplified NP-Complete Graph Problems. Theor. Comput. Sci. 1(3): 237-267(1976) BibTeX
[10]
Nathan Goodman, Oded Shmueli: Tree Queries: A Simple Class of Relational Queries. ACM Trans. Database Syst. 7(4): 653-677(1982) BibTeX
[11]
...
[12]
William Kent: The Universal Relation Revisited. ACM Trans. Database Syst. 8(4): 644-648(1983) BibTeX
[13]
Henry F. Korth, Gabriel M. Kuper, Joan Feigenbaum, Allen Van Gelder, Jeffrey D. Ullman: System/U: A Database System Based on the Universal Relation Assumption. ACM Trans. Database Syst. 9(3): 331-347(1984) BibTeX
[14]
Y. Edmund Lien: On the Semantics of the Entity-Relationship Data Model. ER 1979: 155-168 BibTeX
[15]
David Maier, David Rozenshtein, Sharon C. Salveter, Jacob Stein, David Scott Warren: Toward Logical Data Independence: A Relational Query Language Without Relations. SIGMOD Conference 1982: 51-60 BibTeX
[16]
David Maier, Jeffrey D. Ullman: Maximal Objects and the Semantics of Universal Relation Databases. ACM Trans. Database Syst. 8(1): 1-14(1983) BibTeX
[17]
David Maier, David Scott Warren: Specifying Connections for a Universal Relation Scheme Database. SIGMOD Conference 1982: 1-7 BibTeX
[18]
Michel A. Melkanoff, Carlo Zaniolo: Decomposition of Relations and Synthesis of Entity-Relationship Diagrams. ER 1979: 277-294 BibTeX
[19]
Michael Stonebraker, Eugene Wong, Peter Kreps, Gerald Held: The Design and Implementation of INGRES. ACM Trans. Database Syst. 1(3): 189-222(1976) BibTeX
[20]
Jeffrey D. Ullman: Universal Relation Interfaces for Database Systems. IFIP Congress 1983: 243-252 BibTeX
[21]
...
[22]
...
[23]
...
[24]
...
[25]
...
[26]
Zhi-Qian Zhang, Alberto O. Mendelzon: A Graphical Query Language for Entity-Relationship Databases. ER 1983: 441-448 BibTeX

Referenced by

  1. Amihai Motro: Intensional Answers to Database Queries. IEEE Trans. Knowl. Data Eng. 6(3): 444-454(1994)
  2. Joseph A. Wald, Paul G. Sorenson: Explaining Ambiguity in a Formal Query Language. ACM Trans. Database Syst. 15(2): 125-161(1990)
  3. Amihai Motro: FLEX: A Tolerant and Cooperative User Interface to Databases. IEEE Trans. Knowl. Data Eng. 2(2): 231-246(1990)
  4. Dekang Lin: Automatic Logical Navigation Among Relations Using Steiner Trees. ICDE 1989: 582-588
  5. Victor M. Markowitz, Arie Shoshani: Abbreviated Query Interpretation in Extended Entity-Relationship Oriented Databases. ER 1989: 325-343
  6. Giorgio Ausiello, Alessandro D'Atri, Marina Moscarini: Chordality Properties on Graphs and Minimal Conceptual Connections in Semantic Data Models. PODS 1985: 164-170
BibTeX
ACM SIGMOD Anthology - DBLP: [Home | Search: Author, Title | Conferences | Journals]
TODS, ACM SIGMOD Anthology: Copyright © by ACM (info@acm.org), Corrections: anthology@acm.org
DBLP: Copyright © by Michael Ley (ley@uni-trier.de), last change: Tue Jun 24 18:38:54 2008