Filters








797 Hits in 5.8 sec

Approximate lifted inference with probabilistic databases

Wolfgang Gatterbauer, Dan Suciu
2015 Proceedings of the VLDB Endowment  
We give a detailed experimental evaluation of our approach and, in the process, provide a new way of thinking about the value of probabilistic methods over non-probabilistic methods for ranking query answers  ...  This paper proposes a new approach for approximate evaluation of #P-hard queries with probabilistic databases.  ...  This work was supported in part by NSF grants IIS-0513877, IIS-0713576, IIS-0915054, and IIS-1115188. We thank the reviewers for their careful reading of this manuscript and their detailed feedback.  ... 
doi:10.14778/2735479.2735494 fatcat:safh6aiiwfdlxpitp3bipdxg7y

Approximate Lifted Inference with Probabilistic Databases [article]

Wolfgang Gatterbauer, Dan Suciu
2014 arXiv   pre-print
We give a detailed experimental evaluation of our approach and, in the process, provide a new way of thinking about the value of probabilistic methods over non-probabilistic methods for ranking query answers  ...  This paper proposes a new approach for approximate evaluation of #P-hard queries with probabilistic databases.  ...  This work was supported in part by NSF grants IIS-0513877, IIS-0713576, IIS-0915054, and IIS-1115188. We thank the reviewers for their careful reading of this manuscript and their detailed feedback.  ... 
arXiv:1412.1069v1 fatcat:pqzm45dp5rh6njv5wrybpdj3xq

Dissociation and Propagation for Approximate Lifted Inference with Standard Relational Database Management Systems [article]

Wolfgang Gatterbauer, Dan Suciu
2016 arXiv   pre-print
We give a detailed experimental evaluation of our approach and, in the process, provide a new way of thinking about the value of probabilistic methods over non-probabilistic methods for ranking query answers  ...  This paper proposes an alternative approach for approximate evaluation of conjunctive queries with standard relational databases: In our approach, every query is evaluated entirely in the database engine  ...  Acknowledgements This work was supported in part by NSF grants IIS-0513877, IIS-0713576, IIS-0915054, IIS-1115188, IIS-1247469, and CAREER IIS-1553547.  ... 
arXiv:1310.6257v4 fatcat:ematfjcsdbavzd7siv3q2bikza

Modeling and querying probabilistic XML data

Benny Kimelfeld, Yehoshua Sagiv
2009 SIGMOD record  
Enumerating Matches of Twigs By Theorem 4.2, twig queries can be efficiently evaluated under data complexity.  ...  The second is the complexity of query evaluation over pdocuments (under the usual semantics of querying probabilistic data, e.g., [4, 9, 10] ).  ... 
doi:10.1145/1519103.1519115 fatcat:erad6bgntzdehaogswfv7cfm2y

Probabilistic Databases

Dan Suciu, Dan Olteanu, Christopher Ré, Christoph Koch
2011 Synthesis Lectures on Data Management  
Acknowledgments The authors would like to acknowledge many collaborators and friends who, through their discussions and comments have helped shape our thinking and, thus, have directly or indirectly  ...  Given a query Q and a probabilistic database D, evaluate Q on D.  ...  When used in probabilistic databases, materialized views can make a dramatic impact. Suppose we need to evaluate a Boolean query Q on a BID probabilistic database, and assume Q is unsafe.  ... 
doi:10.2200/s00362ed1v01y201105dtm016 fatcat:2bpr73ml4ffkhmnj37mjbmwgsu

The Continued Saga of DB-IR Integration [chapter]

Ricardo Baeza-Yates, Mariano Consens
2004 Proceedings 2004 VLDB Conference  
Appearance of Vianu under the tag author, in the fragment, increases the rank of this fragment The keyword database must appear in the fragment XSEarch: <proceedings> <inproceedings> <author  ...  IR & Others • Keyword queries: Boolean, context, similarity, etc  ... 
doi:10.1016/b978-012088469-8.50118-2 dblp:conf/vldb/Baeza-YatesC04 fatcat:2lzk6qlgurgbdoj6do2qtxy2za

The Continued Saga of DB-IR Integration [chapter]

R BAEZAYATES, M CONSENS
2004 Proceedings 2004 VLDB Conference  
Appearance of Vianu under the tag author, in the fragment, increases the rank of this fragment The keyword database must appear in the fragment XSEarch: <proceedings> <inproceedings> <author  ...  IR & Others • Keyword queries: Boolean, context, similarity, etc  ... 
doi:10.1016/b978-012088469-8/50118-2 fatcat:dktiusnpj5hcfbu2fopto7psqq

Query Processing on Probabilistic Data: A Survey

Guy Van den Broeck, Dan Suciu
2017 Foundations and Trends in Databases  
Acknowledgements Acknowledgments Guy Van den Broeck was partially supported by NSF grants IIS-1657613, IIS-1633857 and DARPA XAI grant N66001-17-2-4032.  ...  Discuss theoretical properties of query evaluation under this data model, identifying and delineating both tractable queries and hard queries that are unlikely to support efficient evaluation on probabilistic  ...  Chapter 3 discusses weighted model counting and the connection to query evaluation on probabilistic databases.  ... 
doi:10.1561/1900000052 fatcat:jzifdhyvsnh7thqrnuptxbpejy

Handling Uncertainty in Database: An Introduction and Brief Survey

Nermin Abdel-Hakim Othman, Ahmed Sharaf Eldin, Doaa Saad El Zanfaly
2015 Computer and Information Science  
The second is surveying different data management issues in uncertain databases such as join and query processing, database integration, indexing uncertain data, security and information leakage and representation  ...  In this paper we added two other issues which are: security and information leakage and representation formalisms and updated the others issues.  ...  Ranked queries on uncertain database were discussed in introducing two effective pruning methods, spatial and probabilistic, to help reduce the ranked query search space.  ... 
doi:10.5539/cis.v8n3p119 fatcat:z4yofk2dofeylgkzltl7qhxi3u

Database Foundations for Scalable RDF Processing [chapter]

Katja Hose, Ralf Schenkel, Martin Theobald, Gerhard Weikum
2011 Lecture Notes in Computer Science  
We cover search engines as well as federated query processing, highlight differences to classic federated database systems, and discuss efficient techniques for distributed query processing in general  ...  , and query optimization techniques.  ...  In probabilistic databases, SQL is employed as means for formulating queries and for defining views.  ... 
doi:10.1007/978-3-642-23032-5_4 fatcat:5owq3argizaj3epzu4yhuuxc6i

Mimir: Bringing CTables into Practice [article]

Arindam Nandi, Ying Yang, Oliver Kennedy, Boris Glavic, Ronny Fehling, Zhen Hua Liu, Dieter Gawlick
2016 arXiv   pre-print
Mimir wraps around any deterministic database engine using JDBC, extending it with support for probabilistic query processing.  ...  So-called pay-as-you-go data curation techniques allow these high costs to be spread out, first by enabling queries over uncertain and incomplete data, and then by assessing the quality of the query results  ...  and updates [3] .  ... 
arXiv:1601.00073v1 fatcat:tqm5fztn4ffbpfdhoewclpeari

Probabilistic top-kand ranking-aggregate queries

Mohamed A. Soliman, Ihab F. Ilyas, Kevin Chen--Chuan Chang
2008 ACM Transactions on Database Systems  
In this article we introduce new probabilistic formulations for top-k and ranking-aggregate queries in probabilistic databases.  ...  Ranking and aggregating uncertain (probabilistic) data raises new challenges in query semantics and processing, making conventional methods inapplicable.  ...  Most of the proposed probabilistic query processing methods mainly assume Boolean queries, and so they are insufficient to compute probabilistic top-k queries efficiently.  ... 
doi:10.1145/1386118.1386119 fatcat:sa3k6pk7gvabbi3wnx5lzqmcr4

Using Language Models For Information Retrieval

Djoerd Hiemstra, Franciska De Jong
2001 Zenodo  
The application of the model to cross-language information retrieval and adaptive information filtering, and the evaluation of two prototype systems in a controlled experiment.  ...  The development of a model that integrates term weighting, relevance feedback and structured queries.  ...  Acknowledgements The research presented in this thesis is funded in part by the European Union projects Twenty-One, Pop-Eye and Olive, and the Telematics Institute project Druid.  ... 
doi:10.5281/zenodo.570441 fatcat:mfju6ok4t5bzjp2pvp6bktfdn4

User Profiles Modeling in Information Retrieval Systems [chapter]

Václav Snášel, Ajith Abraham, Suhail Owais, Jan Platoš, Pavel Krömer
2010 Emergent Web Intelligence: Advanced Information Retrieval  
The vast number of documents in today's large databases and especially on the World Wide Web causes problems when searching for concrete information.  ...  One of the key elements when searching the web is proper formulation of user queries.  ...  each point mutation C, elitism E, probabilistic selection P, seeded queries S and random initial population R.  ... 
doi:10.1007/978-1-84996-074-8_7 dblp:series/aikp/SnaselAOPK10 fatcat:qjrxikfynfdujbhlcrxiitn3uu

Optimizing Information Retrieval Using Evolutionary Algorithms and Fuzzy Inference System [chapter]

Václav Snášel, Ajith Abraham, Suhail Owais, Jan Platoš, Pavel Krömer
2009 Studies in Computational Intelligence  
For RSV enumeration is crucial the interpretation of query term weight a.  ...  Automatically created and updated user profiles are referred as implicit user profiles.  ... 
doi:10.1007/978-3-642-01088-0_13 fatcat:v5aav346lfdgdpw2u5rsi5rhq4
« Previous Showing results 1 — 15 out of 797 results