828 lines
22 KiB
BibTeX
828 lines
22 KiB
BibTeX
|
|
@inproceedings(GGH1998,
|
|
author = {Erich Gr\"adel and Yuri Gurevich and Colin Hirsch},
|
|
title = "{``The Complexity of Query Reliability''}",
|
|
booktitle = {Proc.\ PODS},
|
|
year = 1998,
|
|
pages = {227--234}
|
|
)
|
|
|
|
|
|
@inproceedings(SD2007,
|
|
author = {Prithviraj Sen and Amol Deshpande},
|
|
title = "{``Representing and Querying Correlated Tuples in
|
|
Probabilistic Databases''}",
|
|
booktitle = {Proc.\ ICDE},
|
|
year = 2007,
|
|
pages = {596--605}
|
|
)
|
|
|
|
|
|
@inproceedings(Koch2008,
|
|
author = {Christoph Koch},
|
|
title = "{``Approximating Predicates and
|
|
Expressive Queries on Probabilistic Databases''}",
|
|
booktitle = {Proc.\ PODS},
|
|
year = 2008
|
|
)
|
|
|
|
|
|
@incollection(KochBook2008,
|
|
author = {Christoph Koch},
|
|
title = "{``MayBMS: A System for Managing Large Uncertain and Probabilistic Databases''}",
|
|
chapter = 6,
|
|
editor = {Charu Aggarwal},
|
|
booktitle = {Managing and Mining Uncertain Data},
|
|
publisher = {Springer-Verlag},
|
|
year = 2008
|
|
)
|
|
|
|
|
|
@article(DP1960,
|
|
author = {Martin Davis and Hillary Putnam},
|
|
title = "{``A Computing Procedure for Quantification Theory''}",
|
|
journal = {Journal of ACM},
|
|
volume = {{\bf 7}},
|
|
number = 3,
|
|
pages = {201--215},
|
|
year = 1960
|
|
)
|
|
|
|
@article(Bat1979,
|
|
author = {Don S. Batory},
|
|
title = "{``On Searching Transposed Files''}",
|
|
journal = tods,
|
|
volume = {{\bf 4}},
|
|
number = 4,
|
|
pages = {531--544},
|
|
year = 1979
|
|
)
|
|
|
|
|
|
@inproceedings(SAB+2005,
|
|
author = {Michael Stonebraker and Daniel J. Abadi and Adam Batkin and
|
|
Xuedong Chen and Mitch Cherniack and Miguel Ferreira and
|
|
Edmond Lau and Amerson Lin and Samuel Madden and
|
|
Elizabeth J. O'Neil and Patrick E. O'Neil and Alex Rasin
|
|
and Nga Tran and Stanley B. Zdonik},
|
|
title = "{``C-Store: A Column-oriented DBMS''}",
|
|
booktitle = {Proc.\ VLDB},
|
|
year = 2005,
|
|
pages = {553--564}
|
|
)
|
|
|
|
|
|
@article(IL1984,
|
|
author = {T. Imielinski and W. Lipski},
|
|
title = "{``Incomplete information in relational databases''}",
|
|
journal = {Journal of ACM},
|
|
volume = {{\bf 31}},
|
|
number = 4,
|
|
year = 1984,
|
|
pages = {761--791}
|
|
)
|
|
|
|
@inproceedings(Wachter:Multistate:2007,
|
|
author = {Michael Wachter and Rolf Haenni},
|
|
title = "{``Multi-state Directed Acyclic Graphs''}",
|
|
booktitle = {Proc.\ Canadian {AI}},
|
|
OPTaddress = {Denver, Colorado},
|
|
year = 2007,
|
|
pages = {464--475}
|
|
)
|
|
|
|
@article(Birnbaum:DP:1999,
|
|
author = {Elazar Birnbaum and Eliezer Lozinskii},
|
|
title = "{``The Good Old Davis-Putnam Procedure Helps Counting Models''}",
|
|
journal = {Journal of AI Research},
|
|
volume = {{\bf 10}},
|
|
number = 6,
|
|
year = 1999,
|
|
pages = {457--477}
|
|
)
|
|
|
|
|
|
|
|
@inproceedings(INV1991,
|
|
author = {T. Imielinski and S. Naqvi and K. Vadaparty},
|
|
title = "{``Incomplete objects --- a data model for design and planning
|
|
applications''}",
|
|
booktitle = {Proc.\ SIGMOD},
|
|
OPTaddress = {Denver, Colorado},
|
|
year = 1991,
|
|
pages = {288--297}
|
|
)
|
|
|
|
|
|
@inproceedings(ASV2001,
|
|
author = "Serge Abiteboul and Luc Segoufin and Victor Vianu",
|
|
title = "{``Representing and Querying {XML} with
|
|
Incomplete Information''}",
|
|
booktitle = "Proc.\ PODS",
|
|
year = "2001"
|
|
)
|
|
|
|
|
|
@article(AKG1991,
|
|
author = {Serge Abiteboul and Paris Kanellakis and G\"osta Grahne},
|
|
title = "{``On the Representation and Querying of Sets of
|
|
Possible Worlds''}",
|
|
journal = {Theor.\ Comput.\ Sci.},
|
|
volume = {{\bf 78}},
|
|
number = 1,
|
|
pages = "158-187",
|
|
year = "1991"
|
|
)
|
|
|
|
|
|
@inproceedings(Gra1984,
|
|
author = {G\"osta Grahne},
|
|
title = "{``Dependency Satisfaction in Databases with
|
|
Incomplete Information''}",
|
|
booktitle = {Proc.\ VLDB},
|
|
year = 1984,
|
|
pages = {37--45}
|
|
)
|
|
|
|
|
|
@book(Gra1991,
|
|
author = {G\"osta Grahne},
|
|
title = "{The Problem of Incomplete Information in Relational Databases}",
|
|
publisher = {Springer-Verlag},
|
|
series = {LNCS},
|
|
number = 554,
|
|
year = 1991
|
|
)
|
|
|
|
|
|
@inproceedings(LW1993,
|
|
author = "Leonid Libkin and Limsoon Wong",
|
|
title = "{``Semantic Representations and Query Languages for {OR}-Sets''}",
|
|
booktitle = {Proc.\ PODS},
|
|
pages = "37--48",
|
|
year = "1993"
|
|
)
|
|
|
|
|
|
@book(AHV95,
|
|
author = {Serge Abiteboul and Richard Hull and Victor Vianu},
|
|
title = "{Foundations of Databases}",
|
|
year = 1995,
|
|
publisher = "Addison-Wesley"
|
|
)
|
|
|
|
|
|
% ancestor paper on the chase, see also MMS79
|
|
@article(ABU79,
|
|
author = {Alfred V. Aho and Catriel Beeri and Jeffrey D. Ullman},
|
|
title = "{``The Theory of Joins in Relational Databases''}",
|
|
journal = tods,
|
|
volume = {{\bf 4}},
|
|
number = 3,
|
|
pages = {297--314},
|
|
year = 1979
|
|
)
|
|
|
|
|
|
% original articulation of the chase (after ABU79)
|
|
@article(MMS79,
|
|
author = {David Maier and Alberto O. Mendelzon and Yehoshua Sagiv},
|
|
title = "{``Testing Implications of Data Dependencies''}",
|
|
journal = tods,
|
|
volume = {{\bf 4}},
|
|
number = 4,
|
|
pages = {455--469},
|
|
year = 1979
|
|
)
|
|
|
|
|
|
@article(RD2000,
|
|
author = {Erhard Rahm and Hong Hai Do},
|
|
title = "{``Erhard Data Cleaning: Problems and Current Approaches''}",
|
|
journal = {IEEE Data Engineering Bulletin},
|
|
year = 2000
|
|
)
|
|
|
|
|
|
@inproceedings(GFSS2000,
|
|
title = "{``AJAX: An Extensible Data Cleaning Tool''}",
|
|
author = {H. Galhardas and D. Florescu and D. Shasha and E Simon},
|
|
booktitle = {Proc.\ SIGMOD},
|
|
year = 2000
|
|
)
|
|
|
|
|
|
@inproceedings(RH2001,
|
|
title = "{``Potter's Wheel: An Interactive Data Cleaning System''}",
|
|
author = {V. Raman and J.M. Hellerstein},
|
|
booktitle = {Proc.\ VLDB},
|
|
year = 2001
|
|
)
|
|
|
|
|
|
@inproceedings(CGGM2003,
|
|
title = "{``Robust and Efficient Fuzzy Match for Online Data Cleaning''}",
|
|
author = {S. Chaudhuri and K. Ganjam and V. Ganti and R. Motwani},
|
|
booktitle = {Proc.\ SIGMOD},
|
|
year = 2003
|
|
)
|
|
|
|
|
|
@inproceedings(Koch2005a,
|
|
title = "{``On the Complexity of Nonrecursive XQuery and Functional Query Languages on Complex Values''}",
|
|
author = {Christoph Koch},
|
|
booktitle = {Proc.\ PODS},
|
|
year = 2005
|
|
)
|
|
|
|
|
|
@inproceedings(INFOMIX,
|
|
author = {Nicola Leone and Gianluigi Greco and Giovambattista Ianni and
|
|
Vincenzino Lio and Giorgio Terracina and Thomas Eiter and
|
|
Wolfgang Faber and Michael Fink and Georg Gottlob and
|
|
Riccardo Rosati and Domenico Lembo and Maurizio Lenzerini and
|
|
Marco Ruzzi and Edyta Kalka and Bartosz Nowicki and
|
|
Witold Staniszkis},
|
|
title = "{``The INFOMIX system for advanced integration of incomplete and inconsistent data''}",
|
|
booktitle = {Proc.\ SIGMOD},
|
|
year = 2005,
|
|
pages = {915--917}
|
|
)
|
|
|
|
|
|
@inproceedings(Koch2005b,
|
|
title = "{``On the Role of Composition in XQuery''}",
|
|
author = {Christoph Koch},
|
|
booktitle = {Proc.\ WebDB},
|
|
year = 2005
|
|
)
|
|
|
|
|
|
% introduction of the notions expression complexity and data complexity
|
|
@inproceedings(Var82,
|
|
author = {Moshe Y. Vardi},
|
|
title = "{``The Complexity of Relational Query Languages''}",
|
|
booktitle = {Proc.\ STOC},
|
|
pages = {137--146},
|
|
OPTaddress = {San Francisco, CA USA},
|
|
OPTmonth = may,
|
|
day = {5--7},
|
|
year = 1982
|
|
)
|
|
|
|
|
|
@inproceedings(ABC1999,
|
|
author = {Marcelo Arenas and Leopoldo E. Bertossi and Jan Chomicki},
|
|
title = "{``Consistent Query Answers in Inconsistent Databases''}",
|
|
booktitle = {Proc.\ PODS},
|
|
pages = {68--79},
|
|
year = 1999
|
|
)
|
|
|
|
|
|
@Misc{IPUMS,
|
|
author = {Steven Ruggles and Matthew Sobek and Trent Alexander and
|
|
Catherine A. Fitch and Ronald Goeken and
|
|
Patricia Kelly Hall and Miriam King and Chad Ronnander},
|
|
title = "{``Integrated Public Use Microdata Series: V3.0''}",
|
|
year = 2004,
|
|
OPTaddress = {Minneapolis MN USA},
|
|
OPTpublisher = {Minnesota Population Center},
|
|
OPTnote = {http://www.ipums.org}
|
|
}
|
|
|
|
|
|
@inproceedings(AD98,
|
|
author = {Serge Abiteboul and Oliver M. Duschka},
|
|
title = "{``Complexity of Answering Queries Using
|
|
Materialized Views''}",
|
|
booktitle = {Proc.\ PODS},
|
|
pages = {254--263},
|
|
year = 1998
|
|
)
|
|
|
|
|
|
@Article{PG1992,
|
|
author = {Jan Paredaens and Dirk Van Gucht},
|
|
title = "{``Converting nested algebra expressions into
|
|
flat algebra expressions''}",
|
|
pages = {65--93},
|
|
year = 1992,
|
|
journal = {{TODS}},
|
|
volume = {17},
|
|
number = {1}
|
|
}
|
|
|
|
|
|
@Article{RBG96,
|
|
author = {Sudhir Rao and Antonio Badia and Dirk Van Gucht},
|
|
title = "{``Providing better support for a class of decision support queries''}",
|
|
pages = {217--227},
|
|
year = 1996,
|
|
journal = {{SIGMOD} Record},
|
|
volume = {25},
|
|
number = {2}
|
|
}
|
|
|
|
|
|
@inproceedings{Rosa06c,
|
|
author = "Riccardo Rosati",
|
|
title = "{``On the decidability and finite controllability of query
|
|
processing in databases with incomplete information''}",
|
|
booktitle = { Proc.\ PODS},
|
|
year = 2006,
|
|
}
|
|
|
|
|
|
@inproceedings(CDLR2004,
|
|
author = {Diego Calvanese and Giuseppe De Giacomo and Maurizio Lenzerini
|
|
and Riccardo Rosati},
|
|
title = "{``Logical Foundations of Peer-To-Peer Data Integration''}",
|
|
booktitle = {PODS 2004},
|
|
pages = {241--251},
|
|
year = 2004
|
|
)
|
|
|
|
|
|
@inproceedings(BB2005,
|
|
author = {Leopoldo E. Bertossi and Loreto Bravo},
|
|
title = "{``Consistent Query Answers in
|
|
Virtual Data Integration Systems''}",
|
|
booktitle = {Inconsistency Tolerance},
|
|
year = 2005,
|
|
pages = {42--83}
|
|
)
|
|
|
|
|
|
@inproceedings(BBFL2005,
|
|
author = {Leopoldo E. Bertossi and Loreto Bravo and Enrico Franconi and
|
|
Andrei Lopatenko},
|
|
title = "{``Complexity and Approximation of Fixing Numerical Attributes
|
|
in Databases Under Integrity Constraints''}",
|
|
booktitle = {Proc.\ DBPL},
|
|
year = 2005,
|
|
pages = {262--278}
|
|
)
|
|
|
|
|
|
@article(ABC2003,
|
|
author = {Marcelo Arenas and Leopoldo E. Bertossi and Jan Chomicki},
|
|
title = "{``Answer sets for consistent query answering in
|
|
inconsistent databases''}",
|
|
journal = {TPLP},
|
|
volume = {{\bf 3}},
|
|
number = {4--5},
|
|
pages = {393--424},
|
|
year = 2003
|
|
)
|
|
|
|
|
|
@inproceedings(CMS2004,
|
|
author = {Jan Chomicki and Jerzy Marcinkowski and Slawomir Staworko},
|
|
title = "{``Computing consistent query answers using conflict
|
|
hypergraphs''}",
|
|
booktitle = {Proc.\ CIKM},
|
|
year = 2004,
|
|
pages = {417--426}
|
|
)
|
|
|
|
|
|
% axioms for inequalities: p.886
|
|
@book(Ull89,
|
|
author = {Jeffrey D. Ullman},
|
|
title = "{Principles of Database \& Knowledge-Base Systems Vol. 2:
|
|
The New Technologies}",
|
|
publisher = {Computer Science Press},
|
|
year = 1989
|
|
)
|
|
|
|
|
|
@inproceedings(BFFR2005,
|
|
author = {Philip Bohannon and Wenfei Fan and Michael Flaster and
|
|
Rajeev Rastogi},
|
|
title = "{``A Cost-Based Model and Effective Heuristic for
|
|
Repairing Constraints by Value Modification}",
|
|
booktitle = {Proc.\ SIGMOD},
|
|
month = jun,
|
|
year = 2005
|
|
)
|
|
|
|
|
|
@inproceedings(BFGJK2007,
|
|
author = {Philip Bohannon and Wenfei Fan and Floris Geerts and
|
|
Xibei Jia and Anastasios Kementsietsidis},
|
|
title = "{``Conditional Functional Dependencies for Data Cleaning''}",
|
|
booktitle = {Proc.\ ICDE},
|
|
year = 2007
|
|
)
|
|
|
|
|
|
@misc(medicinenet,
|
|
key = {MedicineNet},
|
|
title = {\textsf{http://www.medicinenet.com}}
|
|
)
|
|
|
|
|
|
@article(FKMP2005,
|
|
author = {Ronald Fagin and Phokion G. Kolaitis and Renee J. Miller and Lucian Popa},
|
|
title = "{``Data exchange: semantics and query answering''}",
|
|
journal = {Theoretical Computer Science},
|
|
volume = {{\bf 336}},
|
|
number = 1,
|
|
year = 2005,
|
|
pages = {89--124}
|
|
)
|
|
|
|
|
|
|
|
@inproceedings(GT2006,
|
|
author = {Todd J. Green and Val Tannen},
|
|
title = "{``Models for Incomplete and Probabilistic Information''}",
|
|
booktitle = {International Workshop on Incompleteness and
|
|
Inconsistency in Databases (IIDB)},
|
|
year = 2006
|
|
)
|
|
|
|
|
|
|
|
@article(BSHW2006,
|
|
author = {Omar Benjelloun and Anish Das Sarma and Chris Hayworth and Jennifer Widom},
|
|
title = "{``An Introduction to ULDBs and the Trio System''}",
|
|
journal = {{IEEE Data Engineering Bulletin}},
|
|
OPTvolume = {{\bf 336}},
|
|
OPTnumber = 1,
|
|
year = 2006,
|
|
OPTpages = {89--124}
|
|
)
|
|
|
|
|
|
@inproceedings(BDSHW2006,
|
|
author = {Omar Benjelloun and Anish Das Sarma and Alon Halevy and
|
|
Jennifer Widom},
|
|
title = "{``{ULDBs}: Databases with Uncertainty and Lineage''}",
|
|
booktitle = {Proc.\ VLDB},
|
|
year = 2006
|
|
)
|
|
|
|
@inproceedings(STW2008,
|
|
author = { Anish Das Sarma and Martin Theobald and Jennifer Widom},
|
|
title = "{``Exploiting Lineage for Confidence Computation in Uncertain and Probabilistic Databases''}",
|
|
booktitle = {Proc.\ ICDE},
|
|
year = 2008,
|
|
)
|
|
|
|
@MANUAL{triql2006,
|
|
organization = {{Stanford Trio Project}},
|
|
title = "{``TriQL -- The Trio Query Language''}",
|
|
year = {2006},
|
|
OPTedition = {Revision 2.6.0},
|
|
OPTnote = {http://infolab.stanford.edu/~widom/triql.html},
|
|
OPTannote = {}
|
|
}
|
|
|
|
@inproceedings(dalvi04efficient,
|
|
author = "Nilesh Dalvi and Dan Suciu",
|
|
title = "{``Efficient query evaluation on probabilistic databases''}",
|
|
booktitle = "Proc.\ VLDB",
|
|
pages = "864--875",
|
|
year = "2004"
|
|
)
|
|
|
|
@article(dalvi07efficient,
|
|
author = "Nilesh Dalvi and Dan Suciu",
|
|
title = "{``Efficient query evaluation on probabilistic databases''}",
|
|
journal = "VLDB Journal",
|
|
pages = "523--544",
|
|
volume = {{\bf 16}},
|
|
number = {4},
|
|
year = 2007
|
|
)
|
|
|
|
|
|
@inproceedings{RDS07,
|
|
author = {Christopher Re and
|
|
Nilesh Dalvi and
|
|
Dan Suciu},
|
|
title = {Efficient Top-k Query Evaluation on Probabilistic Data},
|
|
booktitle = "Proc.\ ICDE",
|
|
year = {2007},
|
|
pages = {886--895},
|
|
}
|
|
|
|
@inproceedings{suciu05mystiq,
|
|
author = {Jihad Boulos and
|
|
Nilesh Dalvi and
|
|
Bhushan Mandhani and
|
|
Shobhit Mathur and
|
|
Chris Re and
|
|
Dan Suciu},
|
|
title = {{MYSTIQ}: a system for finding more answers by using probabilities},
|
|
booktitle = {Proc.\ SIGMOD},
|
|
year = {2005},
|
|
pages = {891-893},
|
|
}
|
|
|
|
|
|
@inproceedings{miller06clean,
|
|
author = {Periklis Andritsos and Ariel Fuxman and Renee J. Miller},
|
|
title = "{``Clean Answers over Dirty Databases:
|
|
A Probabilistic Approach''}",
|
|
booktitle = {Proc.\ ICDE},
|
|
year = {2006},
|
|
OPTpages = {30},
|
|
}
|
|
|
|
|
|
@misc(GK2008,
|
|
author = {Michaela Goetz and Christoph Koch},
|
|
title = "{``A Compositional Framework
|
|
for Complex Queries over Uncertain Data''}",
|
|
note = {Under submission},
|
|
year = 2008
|
|
)
|
|
|
|
|
|
@techreport(Koch2008-SO,
|
|
author = {Christoph Koch},
|
|
title = "{``A Compositional Query Algebra for Second-Order Logic and
|
|
Uncertain Databases''}",
|
|
number = {arXiv:0807.4620},
|
|
year = 2008
|
|
)
|
|
|
|
|
|
@inproceedings(OHK2008,
|
|
author = {Dan Olteanu and Jiewen Huang and Christoph Koch},
|
|
title = "{``SPROUT: Lazy vs. Eager Query Plans for Tuple-Independent
|
|
Probabilistic Databases.''}",
|
|
booktitle = {Proc.\ ICDE},
|
|
year = 2009
|
|
)
|
|
|
|
|
|
@inproceedings(KO2008,
|
|
author = {Christoph Koch and Dan Olteanu},
|
|
title = "{``Conditioning Probabilistic Databases''}",
|
|
booktitle = {Proc.\ VLDB},
|
|
year = 2008
|
|
)
|
|
|
|
|
|
@article(OKA2008,
|
|
author = {Dan Olteanu and Christoph Koch and Lyublena Antova},
|
|
title = "{``World-set Decompositions: Expressiveness and
|
|
Efficient Algorithms''}",
|
|
journal = {Theoretical Computer Science},
|
|
volume = {{\bf 403}},
|
|
number = 23,
|
|
pages = {265--284},
|
|
year = 2008
|
|
)
|
|
|
|
|
|
@inproceedings(AK-MUD-2008,
|
|
author = {Lyublena Antova and Christoph Koch},
|
|
title = "{``On APIs for Probabilistic Databases''}",
|
|
booktitle = {Proc.\ 2nd International Workshop on Management of Uncertain Data},
|
|
address = {Auckland, New Zealand},
|
|
year = 2008
|
|
)
|
|
|
|
|
|
@inproceedings{AKO07WSD,
|
|
author = {Lyublena Antova and Christoph Koch and Dan Olteanu},
|
|
title = "{``$10^{10^6}$ Worlds and Beyond: Efficient Representation
|
|
and Processing of Incomplete Information''}",
|
|
booktitle = {Proc.\ ICDE},
|
|
year = {2007},
|
|
}
|
|
|
|
|
|
@inproceedings{AKO07WSDb,
|
|
author = {Lyublena Antova and Christoph Koch and Dan Olteanu},
|
|
title = "{``MayBMS: Managing Incomplete Information with
|
|
Probabilistic World-Set Decompositions''}",
|
|
booktitle = {Proc.\ ICDE},
|
|
year = {2007},
|
|
OPTnote = {Demonstration Paper}
|
|
}
|
|
|
|
|
|
@inproceedings{AKO07ISQL,
|
|
author = {Lyublena Antova and Christoph Koch and Dan Olteanu},
|
|
title = "{``From Complete to Incomplete Information and Back''}",
|
|
booktitle = {Proc.\ SIGMOD},
|
|
year = {2007}
|
|
}
|
|
|
|
|
|
@inproceedings(AKO-VLDBDEMO-2007,
|
|
author = {Lyublena Antova and Christoph Koch and Dan Olteanu},
|
|
title = "{``Query Language Support for
|
|
Incomplete Information in the MayBMS System''}",
|
|
booktitle = {Proc.\ VLDB},
|
|
year = 2007
|
|
)
|
|
|
|
|
|
|
|
@inproceedings{AJKO2008,
|
|
author = {Lyublena Antova and Thomas Jansen and
|
|
Christoph Koch and Dan Olteanu},
|
|
title = "{``Fast and Simple Relational Processing of Uncertain Data''}",
|
|
booktitle = {Proc.\ ICDE},
|
|
year = {2008},
|
|
}
|
|
|
|
@inproceedings{OH:SUM:2008,
|
|
author = {Dan Olteanu and Jiewen Huang},
|
|
title = "{``Conjunctive Queries with Inequalities on Probabilistic Databases''}",
|
|
booktitle = {Proc.\ SUM},
|
|
year = 2008
|
|
}
|
|
|
|
|
|
@article{Bryant86,
|
|
author = {Randal E. Bryant},
|
|
title = {Graph-Based Algorithms for Boolean Function Manipulation},
|
|
journal = {IEEE Trans. Computers},
|
|
volume = {35},
|
|
number = {8},
|
|
year = {1986},
|
|
pages = {677-691},
|
|
}
|
|
|
|
@Article{brayton87,
|
|
author = {R. K. Brayton},
|
|
title = "{``Factoring logic functions''}",
|
|
journal = {{IBM J. Res. Develop.}},
|
|
year = {1987},
|
|
OPTkey = {},
|
|
volume = {{\bf 31}}},
|
|
number = {2},
|
|
OPTpages = {},
|
|
OPTmonth = {},
|
|
OPTnote = {},
|
|
OPTannote = {}
|
|
}
|
|
|
|
|
|
@Article{darwicheJAIR02,
|
|
author = {Adnan Darwiche and Pierre Marquis},
|
|
title = "{``A knowlege compilation map''}",
|
|
journal = {{Journal of AI Research}},
|
|
volume = "17",
|
|
pages = "229--264",
|
|
year = "2002"
|
|
}
|
|
|
|
|
|
@Book{Meinel:OBDD:1998,
|
|
author = "Christoph Meinel and Thorsten Theobald",
|
|
title = "Algorithms and Data Structures in {VLSI} Design",
|
|
year = "1998",
|
|
publisher = "Springer-Verlag",
|
|
}
|
|
|
|
@Book{gj79,
|
|
author = "M. R. Garey and D. S. Johnson",
|
|
title = "Computers and intractability; a guide to the theory of
|
|
{\it NP}-completeness",
|
|
year = "1979",
|
|
publisher = "W.H. Freeman",
|
|
}
|
|
|
|
|
|
@TechReport{re06prob,
|
|
author = {Chris Re and Nilesh Dalvi and Dan Suciu},
|
|
title = "{``Probabilistic Databases: Where and How''}",
|
|
institution = {University of Washington},
|
|
OPTkey = {},
|
|
OPTmonth = {},
|
|
year = {2005},
|
|
OPTannote = {}
|
|
}
|
|
|
|
|
|
|
|
@Article{tpch2000,
|
|
author = {Mikel Poess and Chris Floyd},
|
|
title = "{``New TPC Benchmarks for Decision Support and
|
|
Web Commerce''}",
|
|
journal = {{SIGMOD Record}},
|
|
year = {2000},
|
|
OPTkey = {},
|
|
volume = {29},
|
|
number = {4},
|
|
OPTpages = {},
|
|
OPTmonth = {},
|
|
OPTnote = {},
|
|
OPTannote = {}
|
|
}
|
|
|
|
@MANUAL{tpch2006,
|
|
organization = {{Transaction Processing Performance Council}},
|
|
title = {{TPC Benchmark H (Decision Support)}},
|
|
year = {2006},
|
|
edition = {Revision 2.6.0},
|
|
note = {http://www.tpc.org/tpch/spec/tpch2.6.0.pdf},
|
|
OPTannote = {}
|
|
}
|
|
|
|
@inproceedings{division,
|
|
author = {Ralf Rantzau and Christoph Mangold},
|
|
title = "{``Laws for Rewriting Queries
|
|
Containing Division Operators''}",
|
|
booktitle = {Proc.\ ICDE},
|
|
year = {2006}
|
|
}
|
|
|
|
|
|
@inproceedings(BunemanICDT01,
|
|
author = {Peter Buneman and Sanjeev Khanna and Wang-Chiew Tan},
|
|
title = "{``Why and Where: A Characterization of Data Provenance''}",
|
|
booktitle = {Proc.\ ICDT},
|
|
year = 2001
|
|
)
|
|
|
|
|
|
@inproceedings(DS2007,
|
|
author = {Nilesh Dalvi and Dan Suciu},
|
|
title = "{``Management of Probabilistic Data: Foundations and
|
|
Challenges''}",
|
|
booktitle = {Proc.\ PODS},
|
|
year = 2007
|
|
)
|
|
|
|
|
|
@article(EIV2006,
|
|
author = {Ahmed K. Elmagarmid and Panagiotis G. Ipeirotis and
|
|
Vassilios K. Verykios},
|
|
title = "{``Duplicate Record Detection''}",
|
|
journal = {IEEE TKDE},
|
|
volume = {{\bf 19}},
|
|
number = 1,
|
|
year = 2006
|
|
)
|
|
|
|
|
|
@article(FR1997,
|
|
author = {Norbert Fuhr and Thomas R\"olleke},
|
|
title = "{``A Probabilistic Relational Algebra for the
|
|
Integration of Information Retrieval and Database Systems''}",
|
|
journal = {ACM Trans.\ Inf.\ Syst.},
|
|
volume = {{\bf 15}},
|
|
number = 1,
|
|
pages = {32--66},
|
|
year = 1997
|
|
)
|
|
|
|
|
|
@book(Vazirani2001,
|
|
author = {Vijay V. Vazirani},
|
|
title = "{Approximation Algorithms}",
|
|
publisher = {Springer},
|
|
year = 2001
|
|
)
|
|
|
|
|
|
@inproceedings(KL1983,
|
|
author = {Richard M. Karp and Michael Luby},
|
|
title = "{``Monte-Carlo Algorithms for Enumeration and
|
|
Reliability Problems''}",
|
|
booktitle = {Proc.\ FOCS},
|
|
year = 1983,
|
|
pages = {56--64}
|
|
)
|
|
|
|
|
|
@article(KLM1989,
|
|
author = {Richard M. Karp and Michael Luby and Neal Madras},
|
|
title = "{``Monte-Carlo Approximation Algorithms for
|
|
Enumeration Problems''}",
|
|
journal = {J.\ Algorithms},
|
|
volume = {{\bf 10}},
|
|
number = 3,
|
|
pages = {429--448},
|
|
year = 1989
|
|
)
|
|
|
|
|
|
@article(DKLR2000,
|
|
author = {Paul Dagum and Richard M. Karp and Michael Luby and
|
|
Sheldon M. Ross},
|
|
title = "{``An Optimal Algorithm for Monte Carlo Estimation''}",
|
|
journal = {SIAM J.\ Comput.},
|
|
volume = {{\bf 29}},
|
|
number = 5,
|
|
pages = {1484--1496},
|
|
year = 2000
|
|
)
|
|
|
|
@unpublished{OHK2010,
|
|
author = {Dan Olteanu and Jiewen Huang and Christoph Koch},
|
|
title = "{``Approximate Confidence Computation in Probabilistic Databases''}",
|
|
note = "Submitted to ICDE 2010"
|
|
}
|
|
|