765 search results - page 65 / 153 » Query Processing over Incomplete Autonomous Databases |
170
click to vote
ICDE
2005
IEEE
15 years 11 months ago
2005
IEEE
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...
DEXA
2004
Springer
15 years 3 months ago
2004
Springer
Efficient storage and retrieval of trajectory indexes has become an essential requirement for moving objects databases. The existing 3DR-tree is known to be an effective trajectory...
ICDT
2010
ACM
15 years 6 days ago
2010
ACM
When a query is evaluated under bag semantics, each answer is returned as many times as it has derivations. Bag semantics has long been recognized as important, especially when ag...
90
Voted
EDBT
2004
ACM
15 years 10 months ago
2004
ACM
Due to the large difference between seek time and transfer time in current disk technology, it is advantageous to perform large I/O using a single sequential access rather than mu...
VLDB
2001
ACM
15 years 2 months ago
2001
ACM
We are interested in de ning and querying views in a huge and highly heterogeneous XML repository Web scale . In this context, view de nitions are very large and there is no appa...