Optimizing and parallelizing ranked enumeration
نویسندگان
چکیده
منابع مشابه
Optimizing and Parallelizing Ranked Enumeration
Lawler-Murty’s procedure is a general tool for designing algorithms for enumeration problems (i.e., problems that involve the production of a large set of answers in ranked order), which naturally arise in database management. LawlerMurty’s procedure is used in a variety of modern database applications; particularly in those related to keyword search over structured data. Essentially, this proc...
متن کاملRanked Enumeration of Minimal Triangulations
Tree decompositions facilitate computations on complex graphs by grouping vertices into bags interconnected in an acyclic structure; hence their importance in a plethora of problems such as query evaluation over databases and inference over probabilistic graphical models. Different applications take varying benefits from different tree decompositions, and hence, measure them by diverse (sometim...
متن کاملOptimizing Murty ' s Ranked Assignment
We describe an implementation of an algorithm due to Murty for determining a ranked set of solutions to assignment problems. The intended use of the algorithm is in the context of multi-target tracking, where it has been shown that real-time multi-target tracking is now feasible, but many other uses of the algorithm are also possible. Three optimizations are discussed: (1) inheriting dual varia...
متن کاملOptimizing and Parallelizing Brown’s Modular GCD Algorithm
Consider the multivariate polynomial problem over the integers; that is, Gcd(A,B) where A,B ∈ Z[x1, x2, . . . xn]. We can solve this problem by solving the related Gcd problem in Zp[x1, x2, . . . xn] for several primes p, and then reconstructing the solution in the integers using Chinese Remaindering. The question we address in this paper is how fast can we solve the problem Gcd(A,B) in Zp[x1, ...
متن کاملOptimizing Synchronization Algorithm for Auto-parallelizing Compiler
In this paper, we focus on the need for two approaches to optimize producer and consumer synchronization for autoparallelizing compiler. Emphasis is placed on the construction of a criterion model by which the compiler reduce the number of synchronization operations needed to synchronize the dependence in a loop and perform optimization reduces the overhead of enforcing all dependence. In accor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the VLDB Endowment
سال: 2011
ISSN: 2150-8097
DOI: 10.14778/3402707.3402739