• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Models for Incomplete and Probabilistic Information (2006)

Cached

  • Download as a PDF

Download Links

  • [www.cis.upenn.edu]
  • [www.cis.upenn.edu]
  • [www.cs.ucdavis.edu]
  • [www.cis.upenn.edu]
  • [www.cis.upenn.edu]
  • [www.cs.ucdavis.edu]
  • [www.cis.upenn.edu]
  • [www.cs.ucdavis.edu]
  • [www.cis.upenn.edu]
  • [db.cis.upenn.edu]
  • [www.cis.upenn.edu]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Todd J. Green , Val Tannen
Venue:IEEE Data Engineering Bulletin
Citations:50 - 6 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@ARTICLE{Green06modelsfor,
    author = {Todd J. Green and Val Tannen},
    title = {Models for Incomplete and Probabilistic Information},
    journal = {IEEE Data Engineering Bulletin},
    year = {2006},
    volume = {29}
}

Years of Citing Articles

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

Abstract. We discuss, compare and relate some old and some new models for incomplete and probabilistic databases. We characterize the expressive power of c-tables over infinite domains and we introduce a new kind of result, algebraic completion, for studying less expressive models. By viewing probabilistic models as incompleteness models with additional probability information, we define completeness and closure under query languages of general probabilistic database models and we introduce a new such model, probabilistic c-tables, that is shown to be complete and closed under the relational algebra. 1

Citations

2198 Fuzzy sets - Zadeh - 1965
1267 Foundations of Databases - Abiteboul, Hull, et al. - 1995
607 Probability: Theory and Examples - Durrett - 1996
382 Optimal Implementation of Conjunctive Queries in Relational Databases - Chandra, Merlin
282 Incomplete information in relational databases - Imieliński, Lipski - 1984
275 Efficient query evaluation on probabilistic databases - Dalvi, Suciu - 2007
254 Why and where: A characterization of data provenance - Buneman, Khanna, et al. - 2001
248 Complexity of Answering Queries Using Materialized Views - Abiteboul, Duschka - 1998
220 Date exchange: semantics and query answering - Fagin, Kolaitis, et al. - 2005
191 Databases with uncertainty and lineage - Benjelloun, Sarma, et al.
174 Trio: A System for Integrated Management of Data, Accuracy, and Lineage - Widom - 2005
149 A probabilistic relational algebra for the integration of information retrieval and database systems - Fuhr, Rölleke - 1997
145 Probview: a flexible probabilistic database system - Lakshmanan, Leone, et al. - 1997
133 Reasoning about Uncertainty - Halpern - 2003
128 Equivalences among relational expressions with the union and difference operators - Sagiv, Yannakakis - 1980
119 The theory of probabilistic databases - Cavallo, Pittarelli - 1987
111 Tracing the lineage of view data in a warehousing environment - Cui, Widom, et al.
102 Working models for uncertain data - Sarma, Benjelloun, et al. - 2006
99 Provenance semirings - Green, Karvounarakis, et al. - 2007
94 On the representation and querying of sets of possible worlds - Abiteboul, Kanellakis, et al. - 1991
77 S.: A probabilistic relational model and algebra - Dey, Sarkar - 1996
73 Lineage Tracing in Data Warehouses - Cui - 2001
58 Algebraic theory of lattices - Crawley, Dilworth - 1973
53 Probabilistic deductive databases - Lakshmanan, Shiri - 1994
51 der Meyden. Logical approaches to incomplete information: A survey - van - 1998
50 Fast and simple relational processing of uncertain data - Antova, Jansen, et al. - 2008
45 The Problem of Incomplete Information in Relational Databases - Grahne - 1991
44 Update exchange with mappings and provenance - Green, Karvounarakis, et al.
43 Curated databases - Buneman, Cheney, et al. - 2008
37 The complexity of query reliability - Grädel, Gurevich, et al. - 1998
35 Incomplete objects — a data model for design and planning applications - Imielinski, Naqvi, et al. - 1991
34 Debugging Schema Mappings with Routes - Chiticariu, Tan
33 A sound and sometimes complete query evaluation algorithm for relational databases with null values - Reiter - 1986
32 Querying logical databases - Vardi - 1985
28 Answer sets for consistent query answering in inconsistent databases. Theory and Practice of Logic Programming - Arenas, Bertossi, et al. - 2003
28 Semantic representations and query languages for or-sets - Libkin, Wong - 1993
26 A probabilistic relational data model - Barbara, Garcia-Molina, et al. - 1990
24 Aspects of Partial Information in Databases - Libkin - 1994
23 V.S.: Probabilistic object bases - Eiter, Lu, et al. - 2001
23 Containment of conjunctive queries: Beyond relations as sets - Ioannidis, Ramakrishnan - 1995
19 Modeling uncertainty in databases - Sadri - 1991
17 Learning probabilistic relational models with structural uncertainty - Getoor
10 Imperfect information in relational databases - Zimányi, Pirotte - 1996
9 tables - an efficient tool for handling incomplete information in databases - Horn - 1989
5 Query evaluation in probabilistic databases - Zimanyi - 1997
3 Optimal Models of Disjunctive Logic Programs: Semantics, Complexity, and Computation - Leone, Scarcello, et al. - 2004
2 Foundations of probabilistic answers to queries (tutorial - Suciu, Dalvi - 2005
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University