Tomasz Imielinski Department of Computer Science, Rutgers University, New...  Home/Search
Context Related
| unsw.edu.au/~meyden/r...orpaperjcss.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: unsw.edu.au/~meyde...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper introduces a new design methodology, Complexity Tailored Design, for databases containing incomplete information. The novelty of the approach is that it introduces query complexity as a consideration in database design. In general, the problem of evaluating queries in databases with incomplete information is intractable. Complexity Tailored Design consists in setting the values of database design parameters so as to guarantee the efficient (polynomial time) evaluability of selected... (Update)
Context of citations to this paper: More
...stops, without producing the whole normal form. Yet another idea is complexity tailored design of Imielinski, van der Meyden and Vadaparty [16] when queries are forced to run in polynomial time by, for instance, obtaining additional information about some of the or sets, thus...
.... The need for distinguishing two classes of queries against databases with disjunctive information is known in the literature, cf. [9, 10, 12, 16]. Queries that ask questions about the representation of possible worlds are called structural, whereas conceptual queries ask...
Cited by: More
Semantic Representations and Query Languages for Or-Sets - Libkin, Wong (1993) (Correct)
Logics for Emerging Applications of Databases - Chomicki, Saake, van der Meyden (2003) (Correct)
Tractable Reasoning in Knowledge Representation Systems - Dalal (1995) (Correct)
Active bibliography (related documents): More All
0.5: Foundations of Temporal Constraint Databases - Koubarakis (1994) (Correct)
0.5: VQL A Visual Query Language for Uniform Database Access - Aslandogan (1995) (Correct)
0.0: Representation and Querying in Temporal Databases: the Power of .. - Koubarakis (1993) (Correct)
Similar documents based on text: More All
0.2: A Semantic Characterization of an Algorithm for Estimating.. - Hideki Isozaki (1996) (Correct)
0.2: The Complexity Of Querying Indefinite Information: Defined.. - van der Meyden (1992) (Correct)
0.2: Unusual-Length Number-Theoretic Transforms Using Recursive.. - Parker, Benaissa (1995) (Correct)
Related documents from co-citation: More All
5: Incomplete objects --- a data model for design and planning applications (context) - Imielinski, Naqvi et al. - 1991
4: Using powerdomains to generalize relational databases - Buneman, Jung et al. - 1991
4: The definition of Standard ML (context) - Harper, Milner et al. - 1991
BibTeX entry: (Update)
T. Imielinski, R. Van Der Meyden, and K. Vadaparty. Complexity tailored design: A new design methodology for databases with incomplete information. Journal of Computer and System Sciences, 51:405--432, 1995. http://citeseer.ist.psu.edu/imielinski95complexity.html More
@article{ imielinski95complexity,
author = "Tomasz Imielinski and Ron van der Meyden and Kumar V. Vadaparty",
title = "Complexity Tailored Design: A New Design Methodology for Databases With Incomplete Information",
journal = "Journal of Computer and System Sciences",
volume = "51",
number = "3",
pages = "405-432",
year = "1995",
url = "citeseer.ist.psu.edu/imielinski95complexity.html" }
Citations (may not include all citations):1838 Foundations of Logic Programming (context) - Lloyd - 1984
981 Principles of Databases and Knowledge Base Systems (context) - Ullman - 1988
686 A Guide to Theory of NPCompleteness (context) - Garey, Johnson - 1979
380 Constraint Satisfaction in Logic Programming (context) - Van Hentenryck - 1989
379 The Complexity of Relational Query Languages (context) - Vardi - 1982
245 Relational Queries Computable in Polynomial Time - Immerman - 1986
198 Structure and Complexity of Relational Queries - Chandra, Harel - 1982
150 Understanding the New SQL: A Complete Guide (context) - Melton, Simon - 1993
101 Incomplete Information in Relational Databases (context) - Imielinski, Lipski - 1984
49 A Fixpoint Semantics for Disjunctive Logic Programs (context) - Minker, Rajasekhar - 1990
41 the Representation and Querying of Sets of Possible Worlds - Abiteboul, Kanellakis et al. - 1991
31 Incomplete Objects -- A Data Model for Design and Planning A.. (context) - Imielinski, Naqvi et al. - 1991
21 of Computer and System Sciences (context) - Vardi, Logical - 1986
2 Complexity of Querying Databases with OR-Objects (context) - Imielinski, Vadaparty - 1989
2 Querying Designing and Planning Databases (context) - Imielinski, Naqvi et al. - 1991
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cse.unsw.edu.au/~meyden/research/publications.html): More
A Program Refinement Framework Supporting Reasoning.. - Engelhardt, van der.. (2000) (Correct)
Model Checking Knowledge and Time in Systems with Perfect.. - van der Meyden, al. (1999) (Correct)
Common Knowledge and Update in Finite Environments - van der Meyden (1997) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC