311 search results - page 38 / 63 » Approximate XML joins |
EDBT
2009
ACM
15 years 4 months ago
2009
ACM
The concept of time-constrained SQL queries was introduced to address the problem of long-running SQL queries. A key approach adopted for supporting time-constrained SQL queries i...
CPM
2004
Springer
15 years 5 months ago
2004
Springer
Given two undirected trees T and P, the Subtree Homeomorphism Problem is to find whether T has a subtree t that can be transformed into P by removing entire subtrees, as well as ...
AI
2008
Springer
14 years 12 months ago
2008
Springer
Local computation in join trees or acyclic hypertrees has been shown to be linked to a particular algebraic structure, called valuation algebra. There are many models of this alge...
100
click to vote
WWW
2008
ACM
16 years 12 days ago
2008
ACM
Because of the high volume and unpredictable arrival rate, stream processing systems may not always be able to keep up with the input data streams-- resulting in buffer overflow a...
ICDE
2010
IEEE
15 years 11 months ago
2010
IEEE
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...