366 search results - page 63 / 74 » Efficient Query Reformulation in Peer-Data Management System... |
CIKM
1993
Springer
13 years 11 months ago
1993
Springer
match algorithms that can efficiently handleAbstract complex tests in the presence of large amounts of data. Match algorithms that are capable of handling large amounts of On the o...
WWW
2004
ACM
14 years 8 months ago
2004
ACM
Centralized Resource Description Framework (RDF) repositories have limitations both in their failure tolerance and in their scalability. Existing Peer-to-Peer (P2P) RDF repositori...
SIGMOD
2005
ACM
14 years 7 months ago
2005
ACM
Monitoring aggregates on IP traffic data streams is a compelling application for data stream management systems. The need for exploratory IP traffic data analysis naturally leads ...
DBA
2004
13 years 9 months ago
2004
In order to guarantee efficient query processing together with industrial strength, spatial index structures have to be integrated into fully-fledged object-relational database ma...
SIGMOD
2009
ACM
14 years 7 months ago
2009
ACM
Labeling schemes lie at the core of query processing for many XML database management systems. Designing labeling schemes for dynamic XML documents is an important problem that ha...