Sciweavers

919 search results - page 15 / 184
» Efficient computation of view subsets
Sort
View
EDBT
2010
ACM
206views Database» more  EDBT 2010»
14 years 3 months ago
Efficient computation of trade-off skylines
When selecting alternatives from large amounts of data, trade-offs play a vital role in everyday decision making. In databases this is primarily reflected by the top-k retrieval p...
Christoph Lofi, Ulrich Güntzer, Wolf-Tilo Bal...
ICSE
2004
IEEE-ACM
14 years 8 months ago
Efficient Forward Computation of Dynamic Slices Using Reduced Ordered Binary Decision Diagrams
Dynamic slicing algorithms can greatly reduce the debugging effort by focusing the attention of the user on a relevant subset of program statements. Recently algorithms for forwar...
Xiangyu Zhang, Rajiv Gupta, Youtao Zhang
CIKM
2001
Springer
14 years 1 months ago
Index Filtering and View Materialization in ROLAP Environment
Using materialized view to accelerate OLAP queries is one of the most common methods used in ROLAP systems. However, high storage and computation cost make this method very diffic...
Shi Guang Qiu, Tok Wang Ling
ICPR
2006
IEEE
14 years 9 months ago
Exact View-Dependent Visual Hulls
The visual hull is widely used to produce three dimensional models from multiple views, due to the reliability of the resulting surface. This paper presents a novel method for eff...
Adrian Hilton, Gregor Miller
SIGMOD
1996
ACM
120views Database» more  SIGMOD 1996»
14 years 23 days ago
Implementing Data Cubes Efficiently
Decision support applications involve complex queries on very large databases. Since response times should be small, query optimization is critical. Users typically view the data ...
Venky Harinarayan, Anand Rajaraman, Jeffrey D. Ull...