Sciweavers

390 search results - page 28 / 78
» Approximate Query Answering in Locally Closed Databases
Sort
View
VLDB
2000
ACM
129views Database» more  VLDB 2000»
15 years 1 months ago
Offering a Precision-Performance Tradeoff for Aggregation Queries over Replicated Data
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 ...
Chris Olston, Jennifer Widom
EDBT
2008
ACM
103views Database» more  EDBT 2008»
15 years 10 months ago
A stratified approach to progressive approximate joins
Users often do not require a complete answer to their query but rather only a sample. They expect the sample to be either the largest possible or the most representative (or both)...
Wee Hyong Tok, Stéphane Bressan, Mong-Li Le...
ICIP
1998
IEEE
15 years 11 months ago
Invariant-based Data Model for Image Databases
We describe a new invariant-based data model for image databases under our approach for shape-based retrieval. The data model relies on contours description of the image shape, an...
Michael Kliot, Ehud Rivlin
SSD
2005
Springer
98views Database» more  SSD 2005»
15 years 3 months ago
Medoid Queries in Large Spatial Databases
Assume that a franchise plans to open k branches in a city, so that the average distance from each residential block to the closest branch is minimized. This is an instance of the ...
Kyriakos Mouratidis, Dimitris Papadias, Spiros Pap...
CIKM
2009
Springer
15 years 1 months ago
Effective, design-independent XML keyword search
Keyword search techniques that take advantage of XML structure make it very easy for ordinary users to query XML databases, but current approaches to processing these queries rely...
Arash Termehchy, Marianne Winslett