75 search results - page 7 / 15 » Optimal splitters for database partitioning with size bounds |
AIPS
2009
13 years 8 months ago
2009
abstraction heuristics, notably pattern-database and merge-and-shrink heuristics, are employed by some state-ofthe-art optimal heuristic-search planners. The major limitation of t...
PODS
2009
ACM
14 years 8 months ago
2009
ACM
The B-tree is a fundamental external index structure that is widely used for answering one-dimensional range reporting queries. Given a set of N keys, a range query can be answere...
ICDE
2007
IEEE
14 years 2 months ago
2007
IEEE
Main memory is a critical resource when processing non-blocking queries with state intensive operators that require real-time responses. While partitioned parallel processing can ...
GIS
2006
ACM
14 years 8 months ago
2006
ACM
A cartogram is a thematic map that visualizes statistical data about a set of regions like countries, states or provinces. The size of a region in a cartogram corresponds to a par...
VLDB
2004
ACM
14 years 1 months ago
2004
ACM
In data stream applications, data arrive continuously and can only be scanned once as the query processor has very limited memory (relative to the size of the stream) to work with...