ACM SIGMOD Anthology ACM SIGMOD dblp.uni-trier.de

Incomplete Path Expressions and their Disambiguation.

Yannis E. Ioannidis, Yezdi Lashkari: Incomplete Path Expressions and their Disambiguation. SIGMOD Conference 1994: 138-149
@inproceedings{DBLP:conf/sigmod/IoannidisL94,
  author    = {Yannis E. Ioannidis and
               Yezdi Lashkari},
  editor    = {Richard T. Snodgrass and
               Marianne Winslett},
  title     = {Incomplete Path Expressions and their Disambiguation},
  booktitle = {Proceedings of the 1994 ACM SIGMOD International Conference on
               Management of Data, Minneapolis, Minnesota, May 24-27, 1994},
  publisher = {ACM Press},
  year      = {1994},
  pages     = {138-149},
  ee        = {http://doi.acm.org/10.1145/191839.191870, db/conf/sigmod/IoannidisL94.html},
  crossref  = {DBLP:conf/sigmod/94},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX

Abstract

When we, humans, talk to each other we have no trouble disambiguating what another person means, although our statements are almost never meticulously specified down to the very last detail. We `fill in the gaps' using our common-sense knowledge about the world. We present a powerful mechanism that allows users of object-oriented database systems to specify certain types of ad-hoc queries in a manner closer to the way we pose questions to each other. Specifically, the system accepts as input queries with incomplete, and therefore ambiguous, path expressions. From them, it generates queries with fully-specified path expressions that are consistent with those given as input and capture what the user most likely meant by them. This is achieved by mapping the problem of path expression disambiguation to an optimal path computation (in the transitive closure sense) over a directed graph that represents the schema. Our method works by exploiting the semantics of the kinds of relationships in the schema and requires no special knowledge about the contents of the underlying database, i.e., it is domain independent. In a limited set of experiments with human subjects, the proposed mechanism was very successful in disambiguating incomplete path expressions.

Copyright © 1994 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.


ACM SIGMOD Anthology

Online Version (ACM WWW Account required): Full Text in PDF Format

CDROM Version: Load the CDROM "Volume 1 Issue 1, SIGMOD '93-'97" and ...

DVD Version: Load ACM SIGMOD Anthology DVD 1" and ... BibTeX

Printed Edition

Richard T. Snodgrass, Marianne Winslett (Eds.): Proceedings of the 1994 ACM SIGMOD International Conference on Management of Data, Minneapolis, Minnesota, May 24-27, 1994. ACM Press 1994 BibTeX , SIGMOD Record 23(2), June 1994
Contents

Online Edition: ACM Digital Library

[Abstract and Index Terms]
[Full Text in PDF Format, 1309 KB]

References

[1]
Rakesh Agrawal, Shaul Dar, H. V. Jagadish: Direct Transitive Closure Algorithms: Design and Performance Evaluation. ACM Trans. Database Syst. 15(3): 427-458(1990) BibTeX
[2]
...
[3]
...
[4]
...
[5]
...
[6]
...
[7]
Wesley W. Chu, M. A. Merzbacher, L. Berkovich: The Design and Implementation of CoBase. SIGMOD Conference 1993: 517-522 BibTeX
[8]
Paul R. Cohen, Cynthia L. Loiselle: Beyond ISA: Structures for Plausible Inference In Semantic Networks. AAAI 1988: 415-420 BibTeX
[9]
...
[10]
Frédéric Cuppens, Robert Demolombe: Cooperative Answering: A Methodology to Provide Intelligent Access to databases. Expert Database Conf. 1988: 621-643 BibTeX
[11]
...
[12]
Terry Gaasterland, Parke Godfrey, Jack Minker: An Overview of Cooperative Answering. J. Intell. Inf. Syst. 1(2): 123-157(1992) BibTeX
[13]
Yannis E. Ioannidis, Miron Livny, Eben M. Haber, Renée J. Miller, Odysseas G. Tsatalos, Janet L. Wiener: Desktop Experiment Management. IEEE Data Eng. Bull. 16(1): 19-23(1993) BibTeX
[14]
Yannis E. Ioannidis: Advanced User Interfaces for Database Systems, Letter from the Special Issue Editor. SIGMOD Record 21(1): 4(1992) BibTeX
[15]
Yannis E. Ioannidis, Raghu Ramakrishnan, Linda Winger: Transitive Closure Algorithms Based on Graph Traversal. ACM Trans. Database Syst. 18(3): 512-576(1993) BibTeX
[16]
...
[17]
...
[18]
David Maier, David Rozenshtein, David Scott Warren: Windows on the World. SIGMOD Conference 1983: 68-78 BibTeX
[19]
David Maier, Jeffrey D. Ullman, Moshe Y. Vardi: On the Foundations of the Universal Relation Model. ACM Trans. Database Syst. 9(2): 283-308(1984) BibTeX
[20]
...
[21]
Amihai Motro: FLEX: A Tolerant and Cooperative User Interface to Databases. IEEE Trans. Knowl. Data Eng. 2(2): 231-246(1990) BibTeX
[22]
...
[23]
Arnon Rosenthal, Sandra Heiler, Umeshwar Dayal, Frank Manola: Traversal Recursion: A Practical Approach to Supporting Recursive Applications. SIGMOD Conference 1986: 166-176 BibTeX
[24]
Gerard Salton: Automatic Text Processing: The Transformation, Analysis, and Retrieval of Information by Computer. Addison-Wesley 1989, ISBN 0-201-12227-8
BibTeX
[25]
...
[26]
Janet L. Wiener, Yannis E. Ioannidis: A Moose and a Fox Can Aid Scientists with Data Management Problems. DBPL 1993: 376-398 BibTeX
[27]
...

Referenced by

  1. Lars Bækgaard: Event-Entity-Relationship Modeling in Data Warehouse Environments. DOLAP 1999: 9-14
  2. Ashish Mehta, James Geller, Yehoshua Perl, Erich J. Neuhold: The OODB Path-Method Generator (PMG) Using Access Weights and Precomputed Access Relevance. VLDB J. 7(1): 25-47(1998)
  3. Mária Bieliková, Béatrice Finance, Pavol Návrat: A Multi-Level Logic Programming Model of a Query Optimizer. ADBIS 1997: 90-96
  4. Nevzat Hurkan Balkir, Eser Sükan, Gultekin Özsoyoglu, Z. Meral Özsoyoglu: VISUAL: A Graphical Icon-Based Query Language. ICDE 1996: 524-533
BibTeX
ACM SIGMOD Anthology - DBLP: [Home | Search: Author, Title | Conferences | Journals]
ACM SIGMOD Anthology: Copyright © by ACM (info@acm.org), Corrections: anthology@acm.org
DBLP: Copyright © by Michael Ley (ley@uni-trier.de), last change: Sat May 16 23:40:20 2009