Filters








65,175 Hits in 4.1 sec

Dynamic Conjunctive Queries [article]

Thomas Zeume, Thomas Schwentick
2017 arXiv   pre-print
The article investigates classes of queries maintainable by conjunctive queries (CQs) and their extensions and restrictions in the dynamic complexity framework of Patnaik and Immerman.  ...  As a further result, all (statically) FO-definable queries are captured by fragment (2) and a complete characterization of these queries in terms of non-recursive dynamic programs with existential update  ...  Dynamic conjunctive queries In this section we study the relationship between the variants of dynamic conjunctive queries.  ... 
arXiv:1704.01286v1 fatcat:fhf4kj2525ca7ifvnye4vmbh3i

Dynamic conjunctive queries

Thomas Zeume, Thomas Schwentick
2017 Journal of computer and system sciences (Print)  
The paper investigates classes of queries maintainable by conjunctive queries (CQs) and their extensions and restrictions in the dynamic complexity framework of Patnaik and Immerman.  ...  As a further result, all (statically) FO-definable queries are captured by fragment (2) and a complete characterization of these queries in terms of non-recursive dynamic CQ ¬ -programs is given.  ...  This implies that dynamic conjunctive queries extended by negations can maintain all first-order queries.  ... 
doi:10.1016/j.jcss.2017.03.014 fatcat:3ohiovmsmbhq5dnzijyb2uzdju

Forward and Backward Private Dynamic Searchable Symmetric Encryption for Conjunctive Queries [article]

Cong Zuo, Shifeng Sun, Joseph K. Liu, Jun Shao, Josef Pieprzyk, Guiyi Wei
2020 IACR Cryptology ePrint Archive  
Then we describe our forward and backward private DSSE schemes, which support conjunctive queries.  ...  To the best of our knowledge, however, there is no DSSE scheme supporting conjunctive queries, which achieves both forward and backward privacy.  ...  To support updates, researchers [4, 20] introduced the dynamic SSE (DSSE).  ... 
dblp:journals/iacr/ZuoSLSPW20 fatcat:js4wm5f4rfblvi62vf3zmu7tga

User preference extraction using dynamic query sliders in conjunction with UPS-EMO algorithm [article]

Timo Aittokoski, Suvi Tarkkanen
2011 arXiv   pre-print
Our approach is based on intuitive use of dynamic query sliders, which serve as a means to extract preference information and are part of the graphical user interface implemented for the efficient UPS-EMO  ...  Thus, we propose that using dynamic queries in conjunction with EMO (as well as with other MO approaches) increases the performance of the DM.  ...  Figure 1 : 1 An example of a dynamic query slider.  ... 
arXiv:1110.5992v1 fatcat:m2g6ucsezzbn3meczqlrhaivby

Fine-grained Dynamic Searchable Symmetric Encryption for Conjunction Query

Motoki Miyano
The second, improves D-IDX and proposes SSE called Dynamic Cross-Tags(DXT) that can efficiently perform conjunction keyword searches in addition to update operating.  ...  Therefore, w s can be efficiently searched by selecting the query with the lowest appearance frequency among the queries.  ...  This protocol can only search for intersections with conjunction keywords.  ... 
doi:10.15002/00022733 fatcat:7ws27i5cmreplkmgipax7b257u

Optimization of Queries with Conjunction of Predicates

Nicoleta Liviana Tudor
2007 International Journal of Computers Communications & Control  
The System RO-H algorithm for optimizing SPJ queries with conjunction of predicates is a System R Dynamic Programming algorithm that extends optimal linear join subplans using a rank-ordering heuristic  ...  This article presents an approach of the cost model used in optimization of Select-Project-Join (SPJ) queries with conjunction of predicates and proposes a join optimization algorithm named System RO-H  ...  In the next section, we present a different improved System R Dynamic Programming algorithm for optimizing Select-Project-Join queries with conjunction of predicates, based on a heuristic method.  ... 
doi:10.15837/ijccc.2007.3.2361 fatcat:qkgv4ciuxzgmhfw735bxc5s23y

Applying Multi Property Tree for Multi Keyword Rank Searching and Dynamic Update in Cloud

2019 International journal of recent technology and engineering  
It also achieves lower time consumption and computing overhead for queries and trapdoor formation.  ...  Moreover this scheme not only fulfills the searching part but also plays vital role in dynamic update (insertion and deletion) of data provided by the data owner  ...  For enhancing the searching procedure, multi property conjunctive keyword searching method with subset and range query have been proposed. II.  ... 
doi:10.35940/ijrte.b1100.0982s1019 fatcat:cw7zq4av2bbjbjk6kozxiyuqpu

A Memory Efficient Result Cache Scheme for P2P DHT Based on Bloom Filters

Takahiro ARIYOSHI, Satoshi FUJITA
2011 IEICE transactions on information and systems  
In this paper, we study the problem of efficient processing of conjunctive queries in Peer-to-Peer systems based on Distributed Hash Tables (P2P DHT, for short).  ...  By taking such an approach, the cache size for each conjunctive query becomes as small as the size of each file index. The performance of the proposed scheme is evaluated by simulation.  ...  Query Length In general, the effect of result cache depends on the length of given conjunctive queries.  ... 
doi:10.1587/transinf.e94.d.1602 fatcat:nzhpdpmkrzaz3klsseq365x3iq

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  ...  We exhibit a new notion of q-hierarchical conjunctive queries and show that these can be maintained efficiently in the following sense.  ...  Introduction We study the algorithmic problem of answering a conjunctive query ϕ against a dynamically changing relational database D.  ... 
arXiv:1702.06370v1 fatcat:whlmhekt2bf7rdjrf74h7ejezq

Dynamic query interface for spatial proximity query with degree-of-interest varied by distance to query point

Myoungsu Cho, Bohyoung Kim, Dong Kyun Jeong, Yeong-Gil Shin, Jinwook Seo
2010 Proceedings of the 28th international conference on Human factors in computing systems - CHI '10  
If not impossible, it is hard to formulate spatial proximity queries using existing dynamic query widgets such as range sliders.  ...  Author Keywords Dynamic query interface, spatial proximity query, degreeof-interest, tab interface, visual information seeking.  ...  Spatial proximity queries need dynamic queries that support disjunct of conjuncts.  ... 
doi:10.1145/1753326.1753428 dblp:conf/chi/ChoKJSS10 fatcat:txlnda7hhra25aw5up2zdgkyzm

Special issue on best papers of VLDB 2015

Chen Li, Volker Markl
2016 The VLDB journal  
For self-join-free conjunctive queries, there is only a single plan, in which case the authors show that the query evaluation is in PTIME. The paper "Fast and Scalable Inequality Joins"  ...  queries.  ...  The authors also introduce a simple method to estimate the selectivity of inequality joins in order to optimize conjunctive queries and multi-way joins.  ... 
doi:10.1007/s00778-016-0450-5 fatcat:bs244b7w6fbflnahsx5cctaqfi

Document Prioritization for Scalable Query Processing

Hao Wu, Hui Fang
2014 Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management - CIKM '14  
The key challenge is how to efficiently retrieve top-K ranked results for a query. Current search engines process queries in either the conjunctive or disjunctive modes.  ...  of a query is longer.  ...  Thus, dynamic pruning can improve the query processing efficiency without hurting the effectiveness.  ... 
doi:10.1145/2661829.2661914 dblp:conf/cikm/WuF14 fatcat:57kurikpobaxpfxz5aspavvowu

History-Dependent Inference Control of Queries by Dynamic Policy Adaption [chapter]

Joachim Biskup
2011 Lecture Notes in Computer Science  
Now, once one of the conjuncts occurring in the original policy element is known to the user, he must not learn the other conjunct as well.  ...  Notably, the view is dynamically updated after each reaction to a query, whereas the policy is kept unchanged once it has been statically declared by a security officer.  ...  In general, dynamic inference control of queries submitted to an information system necessarily requires us to consider the history of queries and answers related to a particular user.  ... 
doi:10.1007/978-3-642-22348-8_10 fatcat:tmcx32uoyrgo3clsag7424pu5a

Dynamic symbolic database application testing

Chengkai Li, Christoph Csallner
2010 Proceedings of the Third International Workshop on Testing Database Systems - DBTest '10  
We are not aware of any static analysis that does that.Queries single-relation conjunctive selection query.  ...  a branching condition depends on a database tuple, the condition can be rewritten to the same form of the query conjuncts: a ⊙ v .← run q and get the first n q result tuples 4:for each tuple t in do run  ... 
doi:10.1145/1838126.1838133 dblp:conf/sigmod/LiC10 fatcat:5hcfepxytbcoplrtb5q7uhk5bm

A New Caching Technique to Support Conjunctive Queries in P2P DHT

K. KOBATAKE, S. TAGASHIRA, S. FUJITA
2008 IEICE transactions on information and systems  
: P2P DHT, conjunctive query, result cache  ...  In this paper, we propose a new method for supporting conjunctive queries in P2P DHT.  ...  Unfortunately however, most conventional P2P DHT approaches do not support conjunctive (or con- support conjunctive queries in P2P DHT.  ... 
doi:10.1093/ietisy/e91-d.4.1023 fatcat:yfdyh5b5krh7jadme6tw22se4e
« Previous Showing results 1 — 15 out of 65,175 results