2223 search results - page 413 / 445 » Query Optimization in an OODBMS |
134
click to vote
SSDBM
2003
IEEE
15 years 7 months ago
2003
IEEE
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existin...
DEBS
2003
ACM
15 years 7 months ago
2003
ACM
We present a design of a distributed publish-subscribe system that extends the functionality of messaging middleware with “relational subscriptions”, to support timely updates...
104
click to vote
ICALP
2003
Springer
15 years 7 months ago
2003
Springer
Suppose we have n algorithms, quantum or classical, each computing some bit-value with bounded error probability. We describe a quantum algorithm that uses O( √ n) repetitions of...
110
click to vote
HAPTICS
2002
IEEE
15 years 6 months ago
2002
IEEE
: We present a six-degree-of-freedom haptic rendering algorithm using localized contact computations. It takes advantage of high motion coherence due to fast force update and spati...
141
Voted
ICDM
2002
IEEE
15 years 6 months ago
2002
IEEE
The similarity join has become an important database primitive to support similarity search and data mining. A similarity join combines two sets of complex objects such that the r...