Filters








36,802 Hits in 3.4 sec

Optimal Join Algorithms Meet Top-k [article]

Nikolaos Tziavelis, Wolfgang Gatterbauer, Mirek Riedewald
2020 Proceedings of the ACM SIGMOD International Conference on Management of Data   pre-print
We argue that the two areas can and should be studied from a unified point of view in order to achieve optimality in the common model of computation for a very general class of top-k-style join queries  ...  These are related to classic work on k-shortest path algorithms and more general optimization problems, some of which dates back to the 1950s.  ...  join algorithms or top-k queries.  ... 
doi:10.1145/3318464.3383132 pmid:33568888 pmcid:PMC7872590 arXiv:2005.00448v1 fatcat:fahzpuj56reornbc7tv5kuyz4m

Incentive Compatible Multiagent Constraint Optimization [chapter]

Adrian Petcu, Boi Faltings
2005 Lecture Notes in Computer Science  
An extension of this method sacrifices Pareto-optimality in favor of budget-balance: the solutions chosen are not optimal anymore, but the advantage is that the self interested agents pay the taxes between  ...  We present in this paper an incentive-compatible distributed optimization method applied to social choice problems. The method works by computing and collecting VCG taxes in a distributed fashion.  ...  to P(i) Top-down UTIL propagation protocol 5 foreach X k ∈ C(Xi) do compute U T IL k i and send it to X k VALUE propagation protocol 6 get and store in agent view all VALUE messages ( X k ← v * k )  ... 
doi:10.1007/11600930_71 fatcat:76sldpeqirdgxazip45oevsdi4

Top-k Set Similarity Joins

Chuan Xiao, Wei Wang, Xuemin Lin, Haichuan Shang
2009 Proceedings / International Conference on Data Engineering  
An algorithm, topk-join, is proposed to answer top-k similarity join efficiently. It is based on the prefix filtering principle and employs tight upper bounding of similarity values of unseen pairs.  ...  Traditional similarity joins require a user to specify a similarity threshold. In this paper, we study a variant of the similarity join, termed top-k set similarity join.  ...  Section III introduces our basic top-k similarity join algorithm. Several optimizations of the algorithm are presented in Section IV.  ... 
doi:10.1109/icde.2009.111 dblp:conf/icde/XiaoWLS09 fatcat:nnt6lrpx4vebdmzgw7p3pnn5le

A Hybrid of Inference and Local Search for Distributed Combinatorial Optimization

Adrian Petcu, Boi Faltings
2007 2007 IEEE/WIC/ACM International Conference on Intelligent Agent Technology (IAT'07)  
We present a new hybrid algorithm for local search in distributed combinatorial optimization.  ...  LS-DPOP(k) is a utility propagation algorithm controlled by a parameter k which specifies the maximal allowable amount of inference. The maximal space requirements are exponential in this parameter.  ...  P i is always kept in. 6 if |dims(JOIN Pi i )| > k then 7 sort dims(JOIN Pi i ) by root path (P i is always last) 8 mark the first |dims(JOIN Pi i )| − k non-9 compute U T IL Pi i = JOIN Pi i ⊥ Xi and  ... 
doi:10.1109/iat.2007.12 dblp:conf/iat/PetcuF07a fatcat:wyvsg5gzf5hedbvymsitdgmlei

Distributed Evaluation of Top-k Temporal Joins

Julien Pilourdault, Vincent Leroy, Sihem Amer-Yahia
2016 Proceedings of the 2016 International Conference on Management of Data - SIGMOD '16  
RTJ queries are often best interpreted as top-k queries where only the best matches are returned.  ...  We study a particular kind of join, coined Ranked Temporal Join (RTJ), featuring predicates that compare time intervals and a scoring function associated with each predicate to quantify how well it is  ...  We design TKIJ , a parallel multi-way top-k interval join algorithm on Map-Reduce.  ... 
doi:10.1145/2882903.2882912 dblp:conf/sigmod/PilourdaultLA16 fatcat:3lxydli6cbbdrjshwchjym35ea

Efficient top-k simrank-based similarity join

Wenbo Tao, Minghe Yu, Guoliang Li
2014 Proceedings of the VLDB Endowment  
To address this problem, in this paper we study the top-k SimRank-based similarity join problem, which finds k most similar pairs of nodes with the largest SimRank similarities among all possible pairs  ...  We devise an efficient two-step framework to compute top-k similar pairs using the vectors.  ...  Other works include top-k cosine similarity join [9, 12] . CONCLUSION We have studied the top-k SimRank-based similarity join problem.  ... 
doi:10.14778/2735508.2735520 fatcat:a52qsvdh5zdlzpkkc7f4tlgnea

Efficient top-K SimRank-based similarity join

Wenbo Tao, Guoliang Li
2014 Proceedings of the 2014 ACM SIGMOD international conference on Management of data - SIGMOD '14  
To address this problem, in this paper we study the top-k SimRank-based similarity join problem, which finds k most similar pairs of nodes with the largest SimRank similarities among all possible pairs  ...  We devise an efficient two-step framework to compute top-k similar pairs using the vectors.  ...  Other works include top-k cosine similarity join [9, 12] . CONCLUSION We have studied the top-k SimRank-based similarity join problem.  ... 
doi:10.1145/2588555.2612662 dblp:conf/sigmod/TaoL14 fatcat:7fyayxbj7vhxrjby2zjya5xifm

Optimal Solution Stability in Dynamic, Distributed Constraint Optimization

Adrian Petcu, Boi Faltings
2007 2007 IEEE/WIC/ACM International Conference on Intelligent Agent Technology (IAT'07)  
We present RSDPOP, a self-stabilizing optimization algorithm which guarantees optimal solution stability in dynamic environments, based on this definition.  ...  Therefore, the optimization process is continuous, rather than a sequence of solving problem snapshots. We present experimental results from the distributed meeting scheduling domain.  ...  Definition 4 The ⊕ operator (join): U T IL j i ⊕ U T IL j k is the join of two UTIL matrices. This is also a matrix with dim(U T IL j i ) ∪ dim(U T IL j k ) as dimensions.  ... 
doi:10.1109/iat.2007.11 dblp:conf/iat/PetcuF07 fatcat:x52m2l5wzbcbvbgzksudre7jhe

A survey of top-kquery processing techniques in relational database systems

Ihab F. Ilyas, George Beskales, Mohamed A. Soliman
2008 ACM Computing Surveys  
In this survey, we describe and classify top-k processing techniques in relational databases.  ...  We also discuss top-k queries in XML domain, and show their connections to relational approaches.  ...  The J* algorithm adopts a top-k join query model (Section 2.1), where the top-k join results are computed by joining multiple ranked inputs based on a join condition, and scoring the outcome join results  ... 
doi:10.1145/1391729.1391730 fatcat:2vbe23sy3fedzjdqspbni3ul3y

Crowd Database Operators [chapter]

Beth Trushkowsky
2016 Encyclopedia of Database Systems  
The use of crowdsourcing enables these systems to perform query operations that are well suited for people to compute, such as subjective comparisons, fuzzy matching for predicates and joins, entity resolution  ...  To execute a crowd-powered top-k or MAX query, an algorithm could simply sort the whole dataset and return the top value(s).  ...  Algorithms based on tournament sort have been investigated in the literature for implementing crowd-based top-k [8] [9] [10] [11] .  ... 
doi:10.1007/978-1-4899-7993-3_80660-1 fatcat:ztjfybgutrfhnj3sjwk73ngt2i

Flexible and extensible preference evaluation in database systems

Justin J. Levandoski, Ahmed Eldawy, Mohamed F. Mokbel, Mohamed E. Khalefa
2013 ACM Transactions on Database Systems  
., skyline, top-k, k-dominance, kfrequency), the implementation of these methods at the core of a database system is a double-edged sword.  ...  This paper also provides a query optimization framework for FlexPref, as well as a theoretical framework that defines the properties a preference method must exhibit to be implemented in FlexPref.  ...  We compare the FlexPref optimized join implementation (JFlex SKY and JFlex T K ) to the FlexPref sorted list implementation for the skyline and top-k methods (SLFlex SKY and SLFlex T K ).  ... 
doi:10.1145/2508020.2493268 fatcat:a3gsz3ewufd4ddusu6g7pxbipy

Making numerical program analysis fast

Gagandeep Singh, Markus Püschel, Martin Vechev
2015 SIGPLAN notices  
Applying these ideas, we designed new algorithms for the core Octagon operators with better asymptotic runtime than prior work and combined them with the optimization techniques to achieve high actual  ...  optimizations from linear algebra such as vectorization, locality of reference, scalar replacement and others, for improving the key bottlenecks of the domain.  ...  2 + n k i l i ) Dense Top Top O(1) Dense O(n 2 ) Dense Dense i=1 O(n 3 ) Dense Decomposed Decomposed m s i Dense O(n 2 ) m i=1 Decomposed Decomposed s i Top Top Top O(1) Top O(1) i=1 m Top Decomposed Top  ... 
doi:10.1145/2813885.2738000 fatcat:sxp24hrtrberholirv4lpnovbi

Making numerical program analysis fast

Gagandeep Singh, Markus Püschel, Martin Vechev
2015 Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation - PLDI 2015  
Applying these ideas, we designed new algorithms for the core Octagon operators with better asymptotic runtime than prior work and combined them with the optimization techniques to achieve high actual  ...  optimizations from linear algebra such as vectorization, locality of reference, scalar replacement and others, for improving the key bottlenecks of the domain.  ...  2 + n k i l i ) Dense Top Top O(1) Dense O(n 2 ) Dense Dense i=1 O(n 3 ) Dense Decomposed Decomposed m s i Dense O(n 2 ) m i=1 Decomposed Decomposed s i Top Top Top O(1) Top O(1) i=1 m Top Decomposed Top  ... 
doi:10.1145/2737924.2738000 dblp:conf/pldi/SinghPV15 fatcat:fgjjya76izcezmo34z4huxcbcu

Optimal top-k generation of attribute combinations based on ranked lists

Jiaheng Lu, Pierre Senellart, Chunbin Lin, Xiaoyong Du, Shan Wang, Xinxing Chen
2012 Proceedings of the 2012 international conference on Management of Data - SIGMOD '12  
We show that a straightforward extension of an optimal top-k algorithm, the Threshold Algorithm (TA), has shortcomings in solving the top-k,m problem, as it needs to compute a large number of intermediate  ...  In this work, we study a novel top-k query type, called top-k,m queries.  ...  To address this problem, we develop a set of provably optimal algorithms to efficiently answer top-k,m queries.  ... 
doi:10.1145/2213836.2213883 dblp:conf/sigmod/LuSLDWC12 fatcat:2nh43ykcdbbnxalyqzhg4lqnbu

Parallel Data Access for Multiway Rank Joins [chapter]

Adnan Abid, Marco Tagliasacchi
2011 Lecture Notes in Computer Science  
The objectives are: i) minimize the time to get top-K join results. ii) avoid the access to the data that does not contribute to the top-K join results.  ...  This strategy minimizes the time to get top-K join results by extracting data in parallel from all Web services, while it also avoids accessing the data that is not useful to compute top-K join results  ...  Indeed, this optimization of the I/O cost helps reducing the total time to compute the top-K join results as well, yet total time can be further reduced for the following reason: these I/O optimal algorithms  ... 
doi:10.1007/978-3-642-22233-7_4 fatcat:54vaahwr5bdzdfmausicepmpnq
« Previous Showing results 1 — 15 out of 36,802 results