Sciweavers

31 search results - page 2 / 7
» Partial Selection Query in Peer-to-Peer Databases
Sort
View
IDEAS
2006
IEEE
180views Database» more  IDEAS 2006»
13 years 10 months ago
SURCH: Distributed Aggregation over Wireless Sensor Networks
In this paper, we present SURCH, a novel decentralized algorithm for efficient processing of queries generated in sensor networks. Unlike existing techniques, SURCH is fully dist...
Xingbo Yu, Sharad Mehrotra, Nalini Venkatasubraman...
ADL
1997
Springer
171views Digital Library» more  ADL 1997»
13 years 8 months ago
Wavelet-Based Image Indexing Techniques with Partial Sketch Retrieval Capability
This paper describes WBIIS Wavelet-Based Image Indexing and Searching, a new image indexing and retrieval algorithm with partial sketch image searching capability for large imag...
James Ze Wang, Gio Wiederhold, Oscar Firschein, Sh...
CIKM
1998
Springer
13 years 8 months ago
Selectivity Estimation of Window Queries
Despite of the fact that large line segment datasets are appearing more and more frequently in numerous applications involving spatial data, such as GIS 8, 9] multimedia 6] and ev...
Guido Proietti, Christos Faloutsos
AI
2011
Springer
12 years 11 months ago
Contracting preference relations for database applications
The binary relation framework has been shown to be applicable to many real-life preference handling scenarios. Here we study preference contraction: the problem of discarding sele...
Denis Mindolin, Jan Chomicki
VLDB
1995
ACM
129views Database» more  VLDB 1995»
13 years 8 months ago
A Cost Model for Clustered Object-Oriented Databases
Query processing is one of the most, critical issues in Object-Oriented DBMSs. Extensible opt,imizers with efficient, search strategies require a cost model to select the most eff...
Georges Gardarin, Jean-Robert Gruser, Zhao-Hui Tan...