Filters








1,329 Hits in 6.9 sec

Faster query answering in probabilistic databases using read-once functions

Sudeepa Roy, Vittorio Perduca, Val Tannen
2011 Proceedings of the 14th International Conference on Database Theory - ICDT '11  
We first show that given a tuple-independent representation and the provenance graph of an SPJ query plan without self-joins, we can, without using the DNF of a result event expression, efficiently compute  ...  In this paper, we tell a better story for a large subclass of boolean event expressions: those that are generated by conjunctive queries without self-joins and on tuple-independent probabilistic databases  ...  We thank Amol Deshpande and Dan Suciu for useful discussions.  ... 
doi:10.1145/1938551.1938582 dblp:conf/icdt/RoyPT11 fatcat:j6v5lnonzjftrj6gvzccqabiea

Answering Conjunctive Queries under Updates [article]

Christoph Berkholz, Jens Keppeler, Nicole Schweikardt
2017 arXiv   pre-print
For the special case of self-join free conjunctive queries we obtain a dichotomy: if a query is not q-hierarchical, then query enumeration with sublinear^∗ delay and sublinear update time (and arbitrary  ...  For answering Boolean conjunctive queries and for the more general problem of counting the number of solutions of k-ary queries we obtain complete dichotomies: if the query's homomorphic core is q-hierarchical  ...  Fix a number ε > 0 and a self-join free conjunctive query ϕ.  ... 
arXiv:1702.06370v1 fatcat:whlmhekt2bf7rdjrf74h7ejezq

Approximate Lifted Inference with Probabilistic Databases [article]

Wolfgang Gatterbauer, Dan Suciu
2014 arXiv   pre-print
Importantly, this algorithm is a strict generalization of all known results of PTIME self-join-free conjunctive queries: A query is safe if and only if our algorithm returns one single plan.  ...  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  ...  WG would also like to thank Manfred Hauswirth for a small comment in 2007 that was crucial for the development of the ideas in this paper.  ... 
arXiv:1412.1069v1 fatcat:pqzm45dp5rh6njv5wrybpdj3xq

Approximate lifted inference with probabilistic databases

Wolfgang Gatterbauer, Dan Suciu
2015 Proceedings of the VLDB Endowment  
Importantly, this algorithm is a strict generalization of all known results of PTIME self-join-free conjunctive queries: A query is safe if and only if our algorithm returns one single plan.  ...  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  ...  WG would also like to thank Manfred Hauswirth for a small comment in 2007 that was crucial for the development of the ideas in this paper.  ... 
doi:10.14778/2735479.2735494 fatcat:safh6aiiwfdlxpitp3bipdxg7y

Faster Query Answering in Probabilistic Databases using Read-Once Functions [article]

Sudeepa Roy, Vittorio Perduca, Val Tannen
2010 arXiv   pre-print
We first show that given a tuple-independent representation and the provenance graph of an SPJ query plan without self-joins, we can, without using the DNF of a result event expression, efficiently compute  ...  In this paper, we tell a better story for a large subclass of boolean event expressions: those that are generated by conjunctive queries without self-joins and on tuple-independent probabilistic databases  ...  We thank Amol Deshpande and Dan Suciu for useful discussions. References [1] L. Antova, T. Jansen, C. Koch, and D. Olteanu. Fast and simple relational processing of uncertain data.  ... 
arXiv:1012.0335v2 fatcat:ac4nfd67wne7vlyfflqmjqyxny

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

Wolfgang Gatterbauer, Dan Suciu
2016 arXiv   pre-print
Importantly, this algorithm is a strict generalization of all known PTIME self-join-free conjunctive queries: A query is in PTIME if and only if our algorithm returns one single plan.  ...  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  ...  WG would also like to thank Manfred Hauswirth for a small comment in 2007 that was crucial for the development of the ideas in this paper.  ... 
arXiv:1310.6257v4 fatcat:ematfjcsdbavzd7siv3q2bikza

Toward practical query pricing with QueryMarket

Paraschos Koutris, Prasang Upadhyaya, Magdalena Balazinska, Bill Howe, Dan Suciu
2013 Proceedings of the 2013 international conference on Management of data - SIGMOD '13  
To build such a system, we show how to use an Integer Linear Programming formulation of the pricing problem for a large class of queries, even when pricing is computationally hard.  ...  We develop a new pricing system, QueryMarket, for flexible query pricing in a data market based on an earlier theoretical framework (Koutris et al., PODS 2012).  ...  The authors explore in depth the case where the price points are selections on single attributes, and present a dichotomy on the complexity of pricing conjunctive queries without self-joins into NP-complete  ... 
doi:10.1145/2463676.2465335 dblp:conf/sigmod/KoutrisUBHS13 fatcat:37i5h3olijajvaqgjqzytvicju

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  ...  dichotomy for conjunctive queries without self-joins.  ...  Conjunctive Queries Without Self-Joins A non-repeating conjunctive query is called a conjunctive query without self-joins.Thus, CQ NR denotes the set of conjunctive queries without self-joins.  ... 
doi:10.2200/s00362ed1v01y201105dtm016 fatcat:2bpr73ml4ffkhmnj37mjbmwgsu

Query Processing in Blockchain Systems: Current State and Future Challenges

Dennis Przytarski, Christoph Stach, Clémentine Gritti, Bernhard Mitschang
2021 Future Internet  
Owing to this use case, the blockchain system was geared towards efficient storage of data, whereas the processing of complex queries, such as provenance analyses of data history, is out of focus.  ...  In our paper, we therefore investigate novel use cases for blockchain systems and elicit their requirements towards a data store in terms of query capabilities.  ...  Query their requirements towards a data store in terms of query capabilities.  ... 
doi:10.3390/fi14010001 fatcat:axmnkcheyjegjbbhgr4gv5345i

Inference From Visible Information And Background Knowledge [article]

Michael Benedikt, Pierre Bourhis, Balder ten Cate, Gabriele Puppis, Michael Vanden Boom
2018 arXiv   pre-print
of the query can be inferred in some instance of the schema.  ...  We provide a wide-ranging study of the scenario where a subset of the relations in a relational vocabulary are visible to a user --- that is, their complete contents are known --- while the remaining relations  ...  quantified and Q is a conjunctive query whose free variables are exactlyx.  ... 
arXiv:1509.01683v4 fatcat:p7uthzfr7bfp3a35kt6vclusby

Citation analysis of database publications

Erhard Rahm, Andreas Thor
2005 SIGMOD record  
Gerhard Weikum is a Research Director at the Max-Planck Institute of Computer Science in Saarbruecken, Germany.  ...  Gerhard serves on the editorial boards of ACM TODS and IEEE CS TKDE, and he was the program committee chair for the 2004 SIGMOD conference in Paris.  ...  Impact factor The journal impact factor (JIF) determines the average number of citations per paper for a period of two years.  ... 
doi:10.1145/1107499.1107505 fatcat:c4evhhw6y5difggghxsvvdqzeu

Disestablishing Sex and Gender

David B. Cruz
2002 California Law Review  
laws.' 6 ' Bases for a Right to the Free Exercise of Gender One possible basis for a right to the free exercise of gender might be found in the First Amendment's guarantee of freedom of expression.  ...  As this disjunctive/conjunctive phrasing hints, there are different ways in which a constitutional right to the free exercise of gender might be conceived, just as there are different ways to regard the  ... 
doi:10.2307/3481325 fatcat:xuc6k3jz3za5dl4histzlhcg3i

Disestablishing Sex and Gender

David B. Cruz
2001 Social Science Research Network  
laws.' 6 ' Bases for a Right to the Free Exercise of Gender One possible basis for a right to the free exercise of gender might be found in the First Amendment's guarantee of freedom of expression.  ...  As this disjunctive/conjunctive phrasing hints, there are different ways in which a constitutional right to the free exercise of gender might be conceived, just as there are different ways to regard the  ... 
doi:10.2139/ssrn.292279 fatcat:3tia4kksczglrderwenetjldiy

The Sale-of-Control Premium: The Disposition

David Cowan Bayne
1969 California Law Review  
These three together must next be joined to a highly indicative fourth factor.  ...  The conjunction of these four factors forces the question: What must be the nature of a premium that would lead the court to such drastic conclusions?  ... 
doi:10.2307/3479713 fatcat:yyjexsgufrb4radyvjijjuquwi

When Code Isn't Law

Tim Wu
2003 Social Science Research Network  
Once a certain number of users joined the network, stark differences in user bandwidth and the lack of a central mechanism for allocating traffic to more capable users made a crash inevitable.  ...  As a result, economic theory predicts a free-riding or collective action problem: The beneficiaries of the change will wait for others to invest in it and will subsequently free-ride on those efforts.  ...  They save money on the music they download for free, with no need to share those savings with others who did not participate.  ... 
doi:10.2139/ssrn.413201 fatcat:fei6bm5h4jhwteyznpgmnubssq
« Previous Showing results 1 — 15 out of 1,329 results