Sciweavers

2514 search results - page 14 / 503
» On the Computation of Approximations of Database Queries
Sort
View
SIGMOD
1998
ACM
142views Database» more  SIGMOD 1998»
15 years 1 months ago
Dimensionality Reduction for Similarity Searching in Dynamic Databases
Databases are increasingly being used to store multi-media objects such as maps, images, audio and video. Storage and retrieval of these objects is accomplished using multi-dimens...
Kothuri Venkata Ravi Kanth, Divyakant Agrawal, Amb...
183
Voted
ICDE
2008
IEEE
190views Database» more  ICDE 2008»
15 years 11 months ago
Efficient Query Processing in Large Traffic Networks
Abstract-- We present an original graph embedding to speedup distance-range and k-nearest neighbor queries on static and/or dynamic objects located on a (weighted) graph. Our metho...
Hans-Peter Kriegel, Matthias Renz, Peer Kröge...
ICDE
2006
IEEE
128views Database» more  ICDE 2006»
15 years 11 months ago
Partial Selection Query in Peer-to-Peer Databases
In this paper, we propose DBSampler, a query execution mechanism to answer "partial selection" queries in peerto-peer databases. A partial selection query is an arbitrar...
Farnoush Banaei Kashani, Cyrus Shahabi
DASFAA
1993
IEEE
83views Database» more  DASFAA 1993»
15 years 1 months ago
Object-Oriented Database with Rule-Based Query Interface for Genomic Computation
Susumu Goto, Norihiro Sakamoto, Toshihisa Takagi
PODS
2010
ACM
163views Database» more  PODS 2010»
15 years 2 months ago
Computing query probability with incidence algebras
Nilesh N. Dalvi, Karl Schnaitter, Dan Suciu