Sciweavers

55 search results - page 2 / 11
» Reducing Order Enforcement Cost in Complex Query Plans
Sort
View
PVLDB
2008
122views more  PVLDB 2008»
13 years 4 months ago
Identifying robust plans through plan diagram reduction
Estimates of predicate selectivities by database query optimizers often differ significantly from those actually encountered during query execution, leading to poor plan choices a...
Harish D., Pooja N. Darera, Jayant R. Haritsa
ICDE
2008
IEEE
140views Database» more  ICDE 2008»
14 years 6 months ago
A Security Punctuation Framework for Enforcing Access Control on Streaming Data
The management of privacy and security in the context of data stream management systems (DSMS) remains largely an unaddressed problem to date. Unlike in traditional DBMSs where acc...
Rimma V. Nehme, Elke A. Rundensteiner, Elisa Berti...
DASFAA
2004
IEEE
158views Database» more  DASFAA 2004»
13 years 9 months ago
A Cost Model for Spatial Intersection Queries on RI-Trees
Abstract. The efficient management of interval sequences represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tr...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
ICDE
2006
IEEE
124views Database» more  ICDE 2006»
13 years 11 months ago
Systematic Approach for Optimizing Complex Mining Tasks on Multiple Databases
It has been well recognized that data mining is an interactive and iterative process. In order to support this process, one of the long-term goals of data mining research has been...
Ruoming Jin, Gagan Agrawal
DEXA
2005
Springer
80views Database» more  DEXA 2005»
13 years 11 months ago
Optimizing I/O Costs of Multi-dimensional Queries Using Bitmap Indices
Bitmap indices are efficient data structures for processing complex, multi-dimensional queries in data warehouse applications and scientific data analysis. For high-cardinality at...
Doron Rotem, Kurt Stockinger, Kesheng Wu