Access the full text.
Sign up today, get DeepDyve free for 14 days.
J. Provan, M. Ball (1983)
The Complexity of Counting Cuts and of Computing the Probability that a Graph is ConnectedSIAM J. Comput., 12
S. Agrawal, S. Chaudhuri, Gautam Das, A. Gionis (2003)
Automated Ranking of Database Query Results
F. Sadri (1995)
Information Source Tracking Method: Efficiency IssuesIEEE Trans. Knowl. Data Eng., 7
L. Valiant (1979)
The Complexity of Enumeration and Reliability ProblemsSIAM J. Comput., 8
Ronald Fagin, A. Lotem, M. Naor (2001)
Optimal aggregation algorithms for middlewareJ. Comput. Syst. Sci., 66
Reynold Cheng, D. Kalashnikov, Sunil Prabhakar (2003)
Evaluating probabilistic queries over imprecise data
Movie database: http://kdd.ics.uci.edu/database-s/movies/movies.html
R. Ng, V. Subrahmanian (1992)
Probabilistic Logic ProgrammingInf. Comput., 101
Daniel Barbará, H. Garcia-Molina, D. Porter (1992)
The Management of Probabilistic DataIEEE Trans. Knowl. Data Eng., 4
Debabrata Dey, S. Sarkar (1996)
A probabilistic relational model and algebraACM Trans. Database Syst., 21
Vagelis Hristidis, Y. Papakonstantinou (2002)
DISCOVER: Keyword Search in Relational Databases
G. Navarro (2001)
A guided tour to approximate string matchingACM Comput. Surv., 33
F. Sadri (1991)
Reliability of Answers to Queries in Relational DatabasesIEEE Trans. Knowl. Data Eng., 3
S. Agrawal, S. Chaudhuri, Gautam Das (2002)
DBXplorer: a system for keyword-based search over relational databasesProceedings 18th International Conference on Data Engineering
Amihai Motro (1988)
VAGUE: a user interface to relational databases that permits vague queriesACM Trans. Inf. Syst., 6
N. Fuhr, T. Roelleke (1997)
A probabilistic relational algebra for the integration of information retrieval and database systemsACM Trans. Inf. Syst., 15
F. Sadri (1995)
Integrity Constraints in the Information Source Tracking MethodIEEE Trans. Knowl. Data Eng., 7
Movie database: Uci kdd archive
L. Lakshmanan, N. Leone, Robert Ross, V. Subrahmanian (1997)
ProbView: a flexible probabilistic database systemACM Trans. Database Syst., 22
G. Miller (2002)
WordNet: A Lexical Database for the English Language
(1999)
Modern Information Retrieval
E. Zimanyi (1997)
Query evaluation in probabilistic databasesTheor. Comput. Sci., 171
Ronald Fagin, Joseph Halpern (1988)
Reasoning about knowledge and probability
E. Hung, L. Getoor, V. Subrahmanian (2003)
PXML: a probabilistic semistructured data model and algebraProceedings 19th International Conference on Data Engineering (Cat. No.03CH37405)
M. Stoer, Frank Wagner (1997)
A simple min-cut algorithmJ. ACM, 44
J. Zobel, Philip Dart (1996)
Phonetic string matching: lessons from information retrieval
E. Hung, L. Getoor, V. Subrahmanian (2003)
Probabilistic interval XML
Andrew Nierman, H. Jagadish (2002)
ProTDB: Probabilistic Data in XML
R. Karp, M. Luby (1983)
Monte-Carlo algorithms for enumeration and reliability problems24th Annual Symposium on Foundations of Computer Science (sfcs 1983)
E. Zimányi (1997)
Query Evaluation in Probabilistic Relational DatabasesTheor. Comput. Sci., 171
F. Bacchus, Adam Grove, Joseph Halpern, D. Koller (1996)
From Statistical Knowledge Bases to Degrees of BeliefArXiv, cs.AI/0307056
C. Ré, Nilesh Dalvi, Dan Suciu (2006)
Query Evaluation on Probabilistic DatabasesIEEE Data Eng. Bull., 29
R. Cavallo, Michael Pittarelli (1987)
The Theory of Probabilistic Databases
William Cohen (1998)
Integration of heterogeneous databases without common domains using queries based on textual similarity
A. Theobald, G. Weikum (2002)
The XXL search engine: ranked retrieval of XML data using indexes and ontologies
J. Ullman, J. Widom (1997)
A First Course in Database Systems
Thomas Eiter, James Lu, Thomas Lukasiewicz, V. Subrahmanian (2001)
Probabilistic object basesACM Trans. Database Syst., 26
Henrik Nottelmann, N. Fuhr (2003)
Combining DAML+OIL, XSLT, and Probabilistic Logics for Uncertain Schema Mappings in MIND
F. Sadri (1992)
Aggregate Operations in the Information Source Tracking MethodTheor. Comput. Sci., 133
J. Pearl (1991)
Probabilistic reasoning in intelligent systems - networks of plausible inference
Robert Ross, V. Subrahmanian, J. Grant (2005)
Aggregate operators in probabilistic databasesJ. ACM, 52
E. Grädel, Y. Gurevich, C. Hirsch (1998)
The complexity of query reliability
Thomas Lukasiewicz (1998)
Probabilistic Logic Programming
Lin Guo, F. Shao, C. Botev, J. Shanmugasundaram (2003)
XRANK: ranked keyword search over XML documents
We describe a framework for supporting arbitrarily complex SQL queries with “uncertain” predicates. The query semantics is based on a probabilistic model and the results are ranked, much like in Information Retrieval. Our main focus is query evaluation. We describe an optimization algorithm that can compute efficiently most queries. We show, however, that the data complexity of some queries is # P -complete, which implies that these queries do not admit any efficient evaluation methods. For these queries we describe both an approximation algorithm and a Monte-Carlo simulation algorithm.
The VLDB Journal – Springer Journals
Published: Oct 1, 2007
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.