Sciweavers

185 search results - page 9 / 37
» Precise complexity analysis for efficient datalog queries
Sort
View
DASFAA
2010
IEEE
129views Database» more  DASFAA 2010»
15 years 1 months ago
Efficient Approximate Visibility Query in Large Dynamic Environments
Abstract. Visibility query is fundamental to many analysis and decisionmaking tasks in virtual environments. Visibility computation is time complex and the complexity escalates in ...
Leyla Kazemi, Farnoush Banaei Kashani, Cyrus Shaha...
ICDE
1999
IEEE
89views Database» more  ICDE 1999»
15 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, ...
132
Voted
CINQ
2004
Springer
180views Database» more  CINQ 2004»
15 years 1 months ago
Interactivity, Scalability and Resource Control for Efficient KDD Support in DBMS
The conflict between resource consumption and query performance in the data mining context often has no satisfactory solution. This not only stands in sharp contrast to the need of...
Matthias Gimbel, Michael Klein, Peter C. Lockemann
70
Voted
VLDB
1989
ACM
114views Database» more  VLDB 1989»
15 years 1 months ago
Extending the Relational Algebra to Capture Complex Objects
An important direction in database research for non-standard applications (e.g. engineering or design applications) deals with adequate support for complex objects. Without doubt,...
Bernhard Mitschang
CORR
2008
Springer
132views Education» more  CORR 2008»
14 years 9 months ago
Materialized View Selection by Query Clustering in XML Data Warehouses
XML data warehouses form an interesting basis for decision-support applications that exploit complex data. However, native XML database management systems currently bear limited p...
Hadj Mahboubi, Kamel Aouiche, Jérôme ...