2514 search results - page 108 / 503 » On the Computation of Approximations of Database Queries |
168
click to vote
PODS
2003
ACM
16 years 6 months ago
2003
ACM
In this paper we consider general path constraints for semistructured databases. Our general constraints do not suffer from the limitations of the path constraints previously stud...
164
click to vote
FUIN
2006
15 years 6 months ago
2006
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...
179
click to vote
DBISP2P
2003
Springer
15 years 11 months ago
2003
Springer
Databases have employed a schema-based approach to store and retrieve structured data for decades. For peer-to-peer (P2P) networks, similar approaches are just beginning to emerge,...
252
click to vote
SIGMOD
2007
ACM
16 years 6 months ago
2007
ACM
In this demonstration, we present a prototype content-based dissemination broker, called Sonnet, which is built upon structured overlay network. It combines approximate filtering ...
181
click to vote
ICDE
2007
IEEE
16 years 22 days ago
2007
IEEE
We consider the problem of semantic load shedding for continuous queries containing window joins on multiple data streams and propose a robust approach that is effective with the ...