Sciweavers

353 search results - page 48 / 71
» Processing Top-k Join Queries
Sort
View
DBVIS
1993
101views Database» more  DBVIS 1993»
13 years 12 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
PVLDB
2010
85views more  PVLDB 2010»
13 years 6 months ago
Xplus: A SQL-Tuning-Aware Query Optimizer
The need to improve a suboptimal execution plan picked by the query optimizer for a repeatedly run SQL query arises routinely. Complex expressions, skewed or correlated data, and ...
Herodotos Herodotou, Shivnath Babu
SIGMOD
2004
ACM
164views Database» more  SIGMOD 2004»
14 years 8 months ago
Dynamic Plan Migration for Continuous Queries Over Data Streams
Dynamic plan migration is concerned with the on-the-fly transition from one continuous query plan to a semantically equivalent yet more efficient plan. Migration is important for ...
Yali Zhu, Elke A. Rundensteiner, George T. Heinema...
EUROPAR
1999
Springer
14 years 4 days ago
On Disk Allocation of Intermediate Query Results in Parallel Database Systems
For complex queries in parallel database systems, substantial amounts of data must be redistributed between operators executed on different processing nodes. Frequently, such inter...
Holger Märtens
EDBT
2004
ACM
126views Database» more  EDBT 2004»
14 years 8 months ago
Spatial Queries in the Presence of Obstacles
Despite the existence of obstacles in many database applications, traditional spatial query processing utilizes the Euclidean distance metric assuming that points in space are dire...
Jun Zhang, Dimitris Papadias, Kyriakos Mouratidis,...