Sciweavers

182 search results - page 16 / 37
» Approximate Colored Range Queries
Sort
View
DBVIS
1993
101views Database» more  DBVIS 1993»
14 years 16 days ago
Using Visualization to Support Data Mining of Large Existing Databases
In this paper, we present ideas how visualization technology can be used to improve the difficult process of querying very large databases. With our VisDB system, we try to provid...
Daniel A. Keim, Hans-Peter Kriegel
ICDE
2006
IEEE
144views Database» more  ICDE 2006»
14 years 9 months ago
Materialized Sample Views for Database Approximation
We consider the problem of creating a sample view of a database table. A sample view is an indexed, materialized view that permits efficient sampling from an arbitrary range query...
Shantanu Joshi, Chris Jermaine
MEDIAFORENSICS
2010
13 years 10 months ago
Efficient estimation of CFA pattern configuration in digital camera images
This paper proposes an efficient method to determine the concrete configuration of the color filter array (CFA) from demosaiced images. This is useful to decrease the degrees of f...
Matthias Kirchner
SSD
2005
Springer
116views Database» more  SSD 2005»
14 years 1 months ago
PA-Tree: A Parametric Indexing Scheme for Spatio-temporal Trajectories
Abstract. Many new applications involving moving objects require the collection and querying of trajectory data, so efficient indexing methods are needed to support complex spatio...
Jinfeng Ni, Chinya V. Ravishankar
VLDB
2005
ACM
226views Database» more  VLDB 2005»
14 years 1 months ago
BATON: A Balanced Tree Structure for Peer-to-Peer Networks
We propose a balanced tree structure overlay on a peer-to-peer network capable of supporting both exact queries and range queries efficiently. In spite of the tree structure caus...
H. V. Jagadish, Beng Chin Ooi, Quang Hieu Vu