Sciweavers

2514 search results - page 82 / 503
» On the Computation of Approximations of Database Queries
Sort
View
SIGMOD
1989
ACM
94views Database» more  SIGMOD 1989»
15 years 10 months ago
Redundancy in Spatial Databases
Spatial objects other than points and boxes can be stored in spatial indexes, but the techniques usually require the use of approximations that can be arbitrarily bad. This leads ...
Jack A. Orenstein
ACMSE
2007
ACM
15 years 10 months ago
Hierarchical land cover information retrieval in object-oriented remote sensing image databases with native queries
Classification and change detection of land cover types in the remotely sensed images is one of the major applications in remote sensing. This paper presents a hierarchical framew...
Jiang Li
VLDB
2005
ACM
121views Database» more  VLDB 2005»
15 years 12 months ago
Online Estimation For Subset-Based SQL Queries
The largest databases in use today are so large that answering a query exactly can take minutes, hours, or even days. One way to address this problem is to make use of approximati...
Chris Jermaine, Alin Dobra, Abhijit Pol, Shantanu ...
EDBTW
2004
Springer
15 years 11 months ago
Semantic Query Routing and Processing in P2P Database Systems: The ICS-FORTH SQPeer Middleware
Abstract. Peer-to-peer (P2P) computing is currently attracting enormous attention. In P2P systems a very large number of autonomous computing nodes (the peers) pool together their ...
Giorgos Kokkinidis, Vassilis Christophides
CIKM
2006
Springer
15 years 10 months ago
Amnesic online synopses for moving objects
We present a hierarchical tree structure for online maintenance of time-decaying synopses over streaming data. We exemplify such an amnesic behavior over streams of locations take...
Michalis Potamias, Kostas Patroumpas, Timos K. Sel...