Sciweavers

55 search results - page 7 / 11
» Reducing Order Enforcement Cost in Complex Query Plans
Sort
View
GEOINFO
2003
13 years 10 months ago
Efficient Query Processing on the Relational Quadtree
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existing...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
ICDE
1999
IEEE
89views Database» more  ICDE 1999»
14 years 10 months ago
Relative Prefix Sums: An Efficient Approach for Querying Dynamic OLAP Data Cubes
Range sum queries on data cubes are a powerful tool for analysis. A range sum query applies an aggregation operation (e.g., SUM) over all selected cells in a data cube, where the ...
Steven Geffner, Divyakant Agrawal, Amr El Abbadi, ...
ICDIM
2008
IEEE
14 years 3 months ago
Dynamic detection and administration of materialized views based on the Query Graph Model
Database Management Systems (DBMS) are complex software systems which are used in an increasing number of applications. To obtain the best performance for business relevant applic...
Andreas Lübcke, Ingolf Geist, Ronny Bubke
DMDW
2000
93views Management» more  DMDW 2000»
13 years 10 months ago
Storing auxiliary data for efficient maintenance and lineage tracing of complex views
As views in a data warehouse become more complex, the view maintenance process can become very complicated and potentially very inefficient. Storing auxiliary views in the warehou...
Yingwei Cui, Jennifer Widom
PVLDB
2010
111views more  PVLDB 2010»
13 years 3 months ago
PolicyReplay: Misconfiguration-Response Queries for Data Breach Reporting
Recent legislation has increased the requirements of organizations to report data breaches, or unauthorized access to data. While access control policies are used to restrict acce...
Daniel Fabbri, Kristen LeFevre, Qiang Zhu