Sciweavers

360 search results - page 37 / 72
» Dynamic Sample Selection for Approximate Query Processing
Sort
View
PODS
2003
ACM
132views Database» more  PODS 2003»
15 years 12 months ago
The view selection problem for XML content based routing
We consider the view selection problem for XML content based routing: given a network, in which a stream of XML documents is routed and the routing decisions are taken based on re...
Ashish Kumar Gupta, Dan Suciu, Alon Y. Halevy
SIGMOD
2004
ACM
262views Database» more  SIGMOD 2004»
15 years 12 months ago
The Next Database Revolution
Database system architectures are undergoing revolutionary changes. Most importantly, algorithms and data are being unified by integrating programming languages with the database ...
Jim Gray
VLDB
2007
ACM
179views Database» more  VLDB 2007»
16 years 17 hour ago
Mining Approximate Top-K Subspace Anomalies in Multi-Dimensional Time-Series Data
Market analysis is a representative data analysis process with many applications. In such an analysis, critical numerical measures, such as profit and sales, fluctuate over time a...
Xiaolei Li, Jiawei Han
CG
2008
Springer
14 years 12 months ago
A simple and flexible framework to adapt dynamic meshes
Many graphics applications represent deformable surfaces through dynamic meshes. To be consistent during deformations, the dynamic meshes require an adaptation process. In this pa...
Fernando de Goes, Siome Goldenstein, Luiz Velho
DBVIS
1993
101views Database» more  DBVIS 1993»
15 years 3 months 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