Skip to search formSkip to main contentSkip to account menu

Holistic twig joins: optimal XML pattern matching

This paper proposes a novel holistic twig join algorithm, TwigStack, that uses a chain of linked stacks to compactly represent partial results to root-to-leaf query paths, which are then composed to obtain matches for the twig pattern.
View on ACM (opens in a new tab)

Structural joins: a primitive for efficient XML query pattern matching

It is shown that, in some cases, tree-merge algorithms can have performance comparable to stack-tree algorithms, in many cases they are considerably worse, and this behavior is explained by analytical results that demonstrate that, on sorted inputs, the stack- tree algorithms have worst-case I/O and CPU complexities linear in the sum of the sizes of inputs and output, while the tree-MERge algorithms do not have the same guarantee.
View on IEEE (opens in a new tab)

Approximate String Joins in a Database (Almost) for Free

This paper develops a technique for building approximate string join capabilities on top of commercial databases by exploiting facilities already available in them, and demonstrates experimentally the benefits of the technique over the direct use of UDFs.
View via Publisher (opens in a new tab)

TwitterMonitor: trend detection over the twitter stream

TwitterMonitor, a system that performs trend detection over the Twitter stream and provides meaningful analytics that synthesize an accurate description of each topic on Twitter in real time, is presented.
View on ACM (opens in a new tab)

Optimal Histograms with Quality Guarantees

Algorithms for computing optimal bucket boundaries in time proportional to the square of the number of distinct data values, for a broad class of optimality metrics and an enhancement to traditional histograms that allows us to provide quality guarantees on individual selectivity estimates are presented.
View Paper (opens in a new tab)

MRShare: Sharing Across Multiple Queries in MapReduce

A sharing framework tailored to MapReduce is proposed that transforms a batch of queries into a new batch that will be executed more efficiently, by merging jobs into groups and evaluating each group as a single query.
View via Publisher (opens in a new tab)

Monitoring k-nearest neighbor queries over moving objects

This work proposes two efficient and scalable algorithms using grid indices based on indexing objects and queries for k-nearest neighbor queries over moving objects within a geographic area, and shows that these algorithms significantly outperform R-tree-based solutions.
View on IEEE (opens in a new tab)

Aggregate Query Answering on Anonymized Tables

A general framework of permutations-based anonymization to support accurate answering of aggregate queries is presented and it is shown that, for the same grouping, permutation-based techniques can always answer aggregate queries more accurately than generalization-based approaches.
View on IEEE (opens in a new tab)

PREFER: a system for the efficient execution of multi-parametric ranked queries

The results indicate that the proposed algorithms are superior in performance compared to other approaches, both in preprocessing (preparation of materialized views) as well as execution time.
View on ACM (opens in a new tab)

Keyword proximity search in XML trees

XML keyword, proximity queries are defined to return the (possibly heterogeneous) set of minimum connecting trees (MCTs) of the matches to the individual keywords in the query to efficiently execute keyword proximity queries on labeled trees (XML).
View on IEEE (opens in a new tab)
...
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)