Experiments on Adaptive Set Intersections for Text Retrieval Systems

Demaine, Erik D.; López-Ortíz, Alejandro; Munro, J. Ian

doi:10.1007/3-540-44808-x_7

Cited by 47 publications

(87 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…[10]- [13] propose some adaptive algorithms which use the total number of comparisons as measure to evaluate the performance. However, experiment result in [14] shows that such kind of algorithms does not always reduce the time cost in practice.…”

Section: Related Workmentioning

confidence: 99%

A Set Intersection Algorithm Via x-Fast Trie

Ye¹

2016

JCP

View full text Add to dashboard Cite

This paper proposes a simple intersection algorithm for two sorted integer sequences . Our algorithm is designed based on x-fast trie since it provides efficient find and successor operators. We present that our algorithm outperforms skip list based algorithm when one of the sets to be intersected is relatively 'dense' while the other one is (relatively) 'sparse'. Finally, we propose some possible approaches which may optimize our algorithm further.

show abstract

Section: Related Workmentioning

confidence: 99%

A Set Intersection Algorithm Via x-Fast Trie

Ye¹

2016

JCP

View full text Add to dashboard Cite

show abstract

“…Example 1. For instance the following set of arrays forms an instance of signature (4,5,7,6,5) where the first number corresponds to the number of arrays, and the following numbers correspond to the sizes of those arrays. The 1-threshold set is the union of all the arrays; the 2-threshold set is {3, 4, 5, 7, 10, 11}; the 3-threshold set is {5}; and the 4-threshold set is the intersection and is empty.…”

Section: Definition 1 (Instance Signature T-threshold Set [3 Definmentioning

confidence: 99%

“…This algorithm has already been studied before, it can be implemented using the doubling search and binary search algorithms [1,3,6,7,10], and is then of complexity 2 log 2 (p−init) , and can be implemented directly [4] to improve the complexity by a constant factor of less than 2.…”

Section: Algorithmmentioning

confidence: 99%

See 1 more Smart Citation

Deterministic Algorithm for the t-Threshold Set Problem

Barbay

Kenyon

2003

Algorithms and Computation

View full text Add to dashboard Cite

Abstract. Given k sorted arrays, the t-Threshold problem, which is motivated by indexed search engines, consists of finding the elements which are present in at least t of the arrays. We present a new deterministic algorithm for it and prove that, asymptotically in the sizes of the arrays, it is optimal in the alternation model used to study adaptive algorithms. We define the Opt-Threshold problem as finding the smallest non empty t-threshold set, which is equivalent to find the largest t such that the t-threshold set is non empty, and propose a naive algorithm to solve it.

show abstract

“…Search in each list is done using binary search. Note that some other optimizations can also be used [6]. For simplicity, we do not include them in the algorithm.…”

Section: We Can Utilize the Inverted Lists To Access Only Those Rules Inmentioning

confidence: 99%

Querying multiple sets of discovered rules

Tuzhilin

Liu

2002

Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

View full text Add to dashboard Cite

Rule mining is an important data mining task that has been applied to numerous real-world applications. Often a rule mining system generates a large number of rules and only a small subset of them is really useful in applications. Although there exist some systems allowing the user to query the discovered rules, they are less suitable for complex ad hoc querying of multiple data mining rulebases to retrieve interesting rules. In this paper, we propose a new powerful rule query language Rule-QL for querying multiple rulebases that is modeled after SQL and has rigorous theoretical foundations of a rule-based calculus. In particular, we first propose a rule-based calculus RC based on the first-order logic, and then present the language Rule-QL that is at least as expressive as the safe fragment of RC. We also propose a number of efficient query evaluation techniques for Rule-QL and test them experimentally on some representative queries to demonstrate the feasibility of Rule-QL.

show abstract

Experiments on Adaptive Set Intersections for Text Retrieval Systems

Cited by 47 publications

References 6 publications

A Set Intersection Algorithm Via x-Fast Trie

A Set Intersection Algorithm Via x-Fast Trie

Deterministic Algorithm for the t-Threshold Set Problem

Querying multiple sets of discovered rules

Contact Info

Product

Resources

About