1160 search results - page 71 / 232 » Query Processing and Optimization for Pictorial Query Trees |
150
click to vote
SIGMOD
2008
ACM
15 years 10 months ago
2008
ACM
Today's query processing engines do not take advantage of the multiple occurrences of a relation in a query to improve performance. Instead, each instance is treated as a dis...
102
click to vote
ICDE
2011
IEEE
14 years 1 months ago
2011
IEEE
Abstract—We propose a novel collaborative caching framework to support spatial query processing in Mobile Peer-toPeer Networks (MP2PNs). To maximize cache sharing among clients, ...
104
click to vote
ICGI
2000
Springer
15 years 1 months ago
2000
Springer
A subpansive tree is a rooted tree that gives a partial order of nonterminal symbols of a context-free grammar. We formalize subpansive trees as background knowledge of CFGs, and i...
191
click to vote
ICDE
2004
IEEE
15 years 11 months ago
2004
IEEE
The effectiveness of many existing high-dimensional indexing structures is limited to specific types of queries and workloads. For example, while the Pyramid technique and the iMi...
VLDB
1998
ACM
15 years 2 months ago
1998
ACM
In a recent paper, we proposed adding a STOP AFTER clause to SQL to permit the cardinality of a query result to be explicitly limited by query writers and query tools. We demonstr...