2985 search results - page 300 / 597 » Indexing Distributed Complex Data for Complex Queries |
201
click to vote
VMV
2003
15 years 8 months ago
2003
We present a new algorithm for the computation of volumetric intersections of geometrically complex objects, which can be used for the efficient detection of collisions. Our appr...
209
click to vote
IJFCS
2002
15 years 6 months ago
2002
We propose a new data structure to compute the Delaunay triangulation of a set of points in the plane. It combines good worst case complexity, fast behavior on real data, small me...
173
click to vote
CAV
2009
Springer
16 years 7 months ago
2009
Springer
ity Abstraction for Declarative Networking Applications Juan A. Navarro P?erez, Andrey Rybalchenko, and Atul Singh Max Planck Institute for Software Systems (MPI-SWS) Declarative N...
171
click to vote
BNCOD
2003
15 years 8 months ago
2003
Evaluating a query can involve manipulation of large volumes of temporary data. When the volume of data becomes too great, activities such as joins and sorting must use disk, and ...
256
click to vote
SIGMOD
2007
ACM
16 years 6 months ago
2007
ACM
Accurate cardinality estimation is critically important to high-quality query optimization. It is well known that conventional cardinality estimation based on histograms or simila...