1007 search results - page 56 / 202 » Worst-Case Optimal Algorithms for Parallel Query Processing |
177
click to vote
SIGMOD
2008
ACM
16 years 2 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...
111
Voted
EDBT
2010
ACM
15 years 9 months ago
2010
ACM
A recurring manual task in data integration, ontology alignment or model management is finding mappings between complex meta data structures. In order to reduce the manual effor...
122
click to vote
PODS
1999
ACM
15 years 6 months ago
1999
ACM
One of the most important types of query processing in spatial databases and geographic information systems is the spatial join, an operation that selects, from two relations, all...
112
Voted
SIGMOD
2004
ACM
16 years 2 months ago
2004
ACM
Ranking is an important property that needs to be fully supported by current relational query engines. Recently, several rank-join query operators have been proposed based on rank...
196
click to vote
ARTDB
1997
Springer
15 years 6 months ago
1997
Springer
This paper proposes a strategy for parallel composite event detection in Active database systems (DBS). Up to now, the detection is sequential and totally synchronized, and thus p...