714 search results - page 84 / 143 » Continuous Processing of Preference Queries in Data Streams |
ICDE
2005
IEEE
14 years 10 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...
WWW
2008
ACM
13 years 8 months ago
2008
ACM
We propose a novel Partition Path-Based (PPB) grouping strategy to store compressed XML data in a stream of blocks. In addition, we employ a minimal indexing scheme called Block S...
DEXA
2003
Springer
14 years 2 months ago
2003
Springer
Moving-objects databases need a spatio-temporal indexing scheme for moving objects to efficiently process queries over continuously changing locations of the objects. A simple exte...
PATAT
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. Within the field of software agents, there has been increasing interest in automating the process of calendar scheduling in recent years. Calendar (or meeting) schedulin...
IJCAI
1989
13 years 10 months ago
1989
A real-time AI system in the real world needs to monitor an immense volume of data. To do this, the system must filter out much of the incoming data. However, it must remain re ...