Filters








26,932 Hits in 2.4 sec

Commutative Queries

Richard Beigel, Richard Chang
2001 Information and Computation  
Universal Computer Sci. 4, 574-588), who showed that the order of the queries does not matter if the base machine asks only one query to each oracle.  ...  On the other hand, we prove that, for computing functions, the order of oracle queries does matter,  ...  to E and H are commutative.  ... 
doi:10.1006/inco.2000.2918 fatcat:gdwhmor7nnfndly2o5pnkrb62i

A Non-commutative Bilinear Model for Answering Path Queries in Knowledge Graphs [article]

Katsuhiko Hayashi, Masashi Shimbo
2019 arXiv   pre-print
In BlockHolE, relation matrices can be non-commutative, allowing composite relations to be modeled by matrix product.  ...  Although they perform well in predicting atomic relations, composite relations (relation paths) cannot be modeled naturally by the product of relation matrices, as the product of diagonal matrices is commutative  ...  However, when path queries are concerned, commutativity poses a problem.  ... 
arXiv:1909.01567v1 fatcat:n5ulv552hzh2hjr2bfob7xgmke

A Non-commutative Bilinear Model for Answering Path Queries in Knowledge Graphs

Katsuhiko Hayashi, Masashi Shimbo
2019 Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP)  
In BlockHolE, relation matrices can be non-commutative, allowing composite relations to be modeled by matrix product.  ...  Although they perform well in predicting atomic relations, composite relations (relation paths) cannot be modeled naturally by the product of relation matrices, as the product of diagonal matrices is commutative  ...  However, when path queries are concerned, commutativity poses a problem.  ... 
doi:10.18653/v1/d19-1246 dblp:conf/emnlp/HayashiS19 fatcat:qhmhd6klafafngwllmtendvejm

Commutative queries

R. Beigel, R. Chang
Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems  
This improves upon the previous result of Hemaspaandra, Hemaspaandra and Hempel, who showed that the order of the queries does not matter if the base machine asks only one query to each oracle.  ...  We prove that, for solving decision problems, the order of oracle queries does not matter.  ...  to E and H are commutative.  ... 
doi:10.1109/istcs.1997.595168 dblp:conf/istcs/BeigelC97 fatcat:xwiypggr4feezbxeopjhyrxcgq

Clustering and indexing of experience sequences for popularity-driven recommendations

K. Selçuk Candan, Mehmet E. Dönderler, J. Ramamoorthy, Jong W. Kim
2006 Proceedings of the 3rd ACM workshop on Continuous archival and retrival of personal experences - CARPE '06  
We propose a novel two-level index structure, EXPdex, to efficiently answer wildcard (don't care) queries.  ...  We also highlight that don't cares (propositional statements not relevant to the user's query) make the task of popularity indexing challenging.  ...  For example, Figure 2 provides (a) an alphabet and applicable commutativity rules, (b) a wildcard query, and (c,d) two example sequences matching the query based on the commutativity rules.  ... 
doi:10.1145/1178657.1178671 fatcat:oya2dui6xzf25o4652b5eaenvu

Provenance for aggregate queries

Yael Amsterdamer, Daniel Deutch, Val Tannen
2011 Proceedings of the 30th symposium on Principles of database systems of data - PODS '11  
tuples with elements of a commutative semiring and propagating the annotations through query evaluation.  ...  We study in this paper provenance information for queries with aggregation.  ...  The proof is by induction on the query structure, and is straightforward given that for the constructs of SPJU queries homomorphism commutation was shown in [22] , while commutation for the new AGGM construct  ... 
doi:10.1145/1989284.1989302 dblp:conf/pods/AmsterdamerDT11 fatcat:g7soooumoravfns24ykag7cgmq

General Framework for Optimization of Distributed Queries

Sunita M Mahajan
2012 International Journal of Database Management Systems  
Semi-join approach is sufficient to fully reduce the tree queries while semi-joins are not the full reducers for cyclic queries.  ...  Initially the heuristic approach is used to find best evaluation plan among various plans of a single query. By considering only joins, queries are divided into two: tree and cyclic.  ...  Commuting σ with set operations: The σ operation commutes with U, ∩, and -.  ... 
doi:10.5121/ijdms.2012.4303 fatcat:ysr2uvabhnbypcuqb46c2qmpey

Quantum Complexity of Testing Group Commutativity [chapter]

Frédéric Magniez, Ashwin Nayak
2005 Lecture Notes in Computer Science  
We consider the problem of testing the commutativity of a black-box group specified by its k generators.  ...  For the lower bound of Ω(k 2/3 ), we introduce a new technique of reduction for quantum query complexity. Along the way, we prove the optimality of the algorithm of Pak for the randomized model.  ...  With unique encoding of group elements, the randomized query complexity of Group Commutativity is Ω(k). Proof.  ... 
doi:10.1007/11523468_106 fatcat:owywrsgi6zfrnkzcab2p5ohwmq

Quantum Complexity of Testing Group Commutativity

Frederic Magniez, Ashwin Nayak
2007 Algorithmica  
We consider the problem of testing the commutativity of a black-box group specified by its k generators.  ...  For the lower bound of Ω(k 2/3 ), we introduce a new technique of reduction for quantum query complexity. Along the way, we prove the optimality of the algorithm of Pak for the randomized model.  ...  With unique encoding of group elements, the randomized query complexity of Group Commutativity is Ω(k). Proof.  ... 
doi:10.1007/s00453-007-0057-8 fatcat:q2vmv3ufyjhodmw3ewg3u5xncq

Comfride

Rohit Verma, Surjya Ghosh, Mahankali Saketh, Niloy Ganguly, Bivas Mitra, Sandip Chakraborty
2018 Proceedings of the 12th ACM Conference on Recommender Systems - RecSys '18  
We use a 'Dynamic Input/Output Automata' based composition model to capture both the wide varieties of comfort choices from the commuters and the impact of environment on the comfort parameters.  ...  of ComfRide, involving 50 participants over 28 routes in a state capital of India, reveals that recommended routes have on average 30% better comfort level than Google map recommended routes, when a commuter  ...  Adjust Feature Weight (correct(F , W)) In the ComfRide app, a commuter gives a score on a 5-point scale to each of the predominant features between the s-d pair of the query.  ... 
doi:10.1145/3240323.3240359 dblp:conf/recsys/VermaGMGMC18 fatcat:zd4m2cf5inf3jnbnq3ri2gkdqa

Defending against Attribute-Correlation Attacks in Privacy-Aware Information Brokering [chapter]

Fengjun Li, Bo Luo, Peng Liu, Anna C. Squicciarini, Dongwon Lee, Chao-Hsien Chu
2009 Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering  
We show that the proposed content-based XPath query routing scheme with level-based encryption and commutative encryption can effectively prevent an attribute-correlation attack originated by compromised  ...  However, they are still vulnerable to attribute-correlation attacks during query routing, due to the lack of protection of the routed queries.  ...  A commutative encryption based scheme is further designed to protect query content from irrelevant brokers.  ... 
doi:10.1007/978-3-642-03354-4_9 fatcat:isyzaumzsvg6xge52zirw4e6ca

Fast incremental proximity search in large graphs

Purnamrita Sarkar, Andrew W. Moore, Amit Prakash
2008 Proceedings of the 25th international conference on Machine learning - ICML '08  
The proposed algorithm can answer queries on the fly without caching any information about the entire graph.  ...  We present empirical results on a 600, 000 node author-word-citation graph from the Citeseer domain on a single CPU machine where the average query processing time is around 4 seconds.  ...  Table 1 . 1 Run-time in seconds for Exact hitting time from query, Sampled hitting time from query, Exact commute time, Hybrid commute time, Exact hitting time to query, PPV # nodes # edges Task Exact  ... 
doi:10.1145/1390156.1390269 dblp:conf/icml/SarkarMP08 fatcat:rxwjeyc25rhhpmxzohsxiqghiq

Complexity of Linear Operators

Alexander S. Kulikov, Ivan Mikhailin, Andrey Mokhov, Vladimir Podolskii, Michael Wagner
2019 International Symposium on Algorithms and Computation  
However, for the case when the semigroup is commutative, we give a constructive proof of an O(z) upper bound.  ...  As we observe in this paper, this problem contains as a special case the well-known range queries problem and has a rich variety of applications in such areas as graph algorithms, functional programming  ...  ( commutative) range queries problem over X sym has O(s) size circuits (non-commutative) range queries problem over X has O(s) size circuits (non-commutative) dense linear operator problem over X has  ... 
doi:10.4230/lipics.isaac.2019.17 dblp:conf/isaac/KulikovMMP19 fatcat:mtcvgw7kxbh2daweo75xmwws4u

A Novel Metric for Information Retrieval in Semantic Networks [chapter]

Joshua L. Moore, Florian Steinke, Volker Tresp
2012 Lecture Notes in Computer Science  
First, given a semantic entity-relationship graph, such as for example DBpedia, we find relevant neighbors for a given query node.  ...  Our distance metric is also related to the commute distance, which is highly plausible for the described tasks but prohibitively expensive to compute.  ...  For each query, we extract the 1000 closest nodes to the query node -in step distance -and only use the subgraph spanned by these nodes and the edges between them to compute the commute distance using  ... 
doi:10.1007/978-3-642-25953-1_6 fatcat:r5sqxzvznnfr7dlvr7jgxbfp3q

Provenance for Aggregate Queries [article]

Yael Amsterdamer, Daniel Deutch, Val Tannen
2011 arXiv   pre-print
tuples with elements of a commutative semiring and propagating the annotations through query evaluation.  ...  Finally, we use aggregation to encode queries with difference, and study the semantics obtained for such queries on provenance annotated databases.  ...  The commutation with homomorphism allows us to first evaluate the query and only then map the ri's, changing directly the expression in the query result.  ... 
arXiv:1101.1110v1 fatcat:koyofk2rirfz5iuhvx5oo7pa7q
« Previous Showing results 1 — 15 out of 26,932 results