353 search results - page 55 / 71 » Processing Top-k Join Queries |
SIGMOD
2011
ACM
12 years 10 months ago
2011
ACM
We present the design, implementation, and evaluation of ArrayStore, a new storage manager for complex, parallel array processing. ArrayStore builds on prior work in the area of m...
ICDE
2003
IEEE
14 years 9 months ago
2003
IEEE
The long-running nature of continuous queries poses new scalability challenges for dataflow processing. CQ systems execute pipelined dataflows that may be shared across multiple q...
ICDE
2005
IEEE
14 years 9 months ago
2005
IEEE
Sequence-based XML indexing aims at avoiding expensive join operations in query processing. It transforms structured XML data into sequences so that a structured query can be answ...
VLDB
2002
ACM
14 years 8 months ago
2002
ACM
The view selection problem is to choose a set of views to materialize over a database schema, such that the cost of evaluating a set of workload queries is minimized and such that ...
GIS
2006
ACM
14 years 8 months ago
2006
ACM
Efficient evaluation of spatial queries is an important issue in spatial database. Among spatial operations, spatial join is very useful, intersection being the most common predic...