Sciweavers

1238 search results - page 70 / 248
» View-based query containment
Sort
View
SIGMOD
2004
ACM
127views Database» more  SIGMOD 2004»
15 years 10 months ago
Efficient Query Reformulation in Peer-Data Management Systems
Peer data management systems (PDMS) offer a flexible architecture for decentralized data sharing. In a PDMS, every peer is associated with a schema that represents the peer's...
Igor Tatarinov, Alon Y. Halevy
EDBT
2009
ACM
104views Database» more  EDBT 2009»
15 years 4 months ago
A query processor for prediction-based monitoring of data streams
Networks of sensors are used in many different fields, from industrial applications to surveillance applications. A common feature of these applications is the necessity of a mo...
Sergio Ilarri, Ouri Wolfson, Eduardo Mena, Arantza...
CIKM
2006
Springer
15 years 1 months ago
Information retrieval from relational databases using semantic queries
Relational databases are widely used today as a mechanism for providing access to structured data. They, however, are not suitable for typical information finding tasks of end use...
Anand Ranganathan, Zhen Liu
ICDE
2005
IEEE
128views Database» more  ICDE 2005»
15 years 11 months ago
Exploiting Correlated Attributes in Acquisitional Query Processing
Sensor networks and other distributed information systems (such as the Web) must frequently access data that has a high per-attribute acquisition cost, in terms of energy, latency...
Amol Deshpande, Carlos Guestrin, Wei Hong, Samuel ...
STOC
2003
ACM
193views Algorithms» more  STOC 2003»
15 years 10 months ago
Space efficient dynamic stabbing with fast queries
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
Mikkel Thorup