6004 search results - page 1058 / 1201 » Parallelizing query optimization |
COMPGEOM
2000
ACM
14 years 1 months ago
2000
ACM
We describe a kinetic data structure (KDS) that maintains the connected components of the union of a set of unit-radius disks moving in the plane. We assume that the motion of eac...
CIKM
2000
Springer
14 years 1 months ago
2000
Springer
An e ective bu er management system is crucial for any database management system. While much work has been expended to provide extensible data types,extensible query languages an...
FOCS
1999
IEEE
14 years 1 months ago
1999
IEEE
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...
LPAR
1999
Springer
14 years 1 months ago
1999
Springer
In this work, we develop a partial evaluation technique for residuating functional logic programs, which generalize the concurrent computation models for logic programs with delays...
SIGMOD
1998
ACM
14 years 1 months ago
1998
ACM
Semistructured data is characterized by the lack of any fixed and rigid schema, although typically the data hassomeimplicitstructure. While thelack offixedschemamakesextracting ...