735 search results - page 11 / 147 » Evaluating Probabilistic Queries over Imprecise Data |
WSNA
2003
ACM
15 years 5 months ago
2003
ACM
Sensor networks have become an important source of data with numerous applications in monitoring various real-life phenomena as well as industrial applications and traffic contro...
101
click to vote
EDBT
2010
ACM
15 years 3 months ago
2010
ACM
Probabilistic top-k ranking queries have been extensively studied due to the fact that data obtained can be uncertain in many real applications. A probabilistic top-k ranking quer...
EDBT
2004
ACM
15 years 11 months ago
2004
ACM
XML suffers from the major limitation of high redundancy. Even if compression can be beneficial for XML data, however, once compressed, the data can be seldom browsed and queried i...
105
click to vote
VLDB
2000
ACM
15 years 3 months ago
2000
ACM
Strict consistency of replicated data is infeasible or not required by many distributed applications, so current systems often permit stale replication, in which cached copies of ...
153
click to vote
Publication
Thanaa M. Ghanem, Moustafa A. Hammad, Mohamed F. Mokbel, Walid G. Aref, and Ahmed K. Elmagarmid. "Incremental Evaluation of Sliding-window Queries over Data Streams". IEE...