Sciweavers

76 search results - page 10 / 16
» Answering queries using materialized views with minimum size
Sort
View
CIKM
2010
Springer
13 years 6 months ago
A hierarchical approach to reachability query answering in very large graph databases
The cost of reachability query computation using traditional algorithms such as depth first search or transitive closure has been found to be prohibitive and unacceptable in mass...
Saikat K. Dey, Hasan M. Jamil
SIGMOD
1997
ACM
159views Database» more  SIGMOD 1997»
13 years 12 months ago
On-Line Warehouse View Maintenance
Data warehouses store materialized views over base data from external sources. Clients typically perform complex read-only queries on the views. The views are refreshed periodical...
Dallan Quass, Jennifer Widom
SIGMOD
2004
ACM
198views Database» more  SIGMOD 2004»
14 years 7 months ago
Secure XML Querying with Security Views
The prevalent use of XML highlights the need for a generic, flexible access-control mechanism for XML documents that supports efficient and secure query access, without revealing ...
Wenfei Fan, Chee Yong Chan, Minos N. Garofalakis
SIGMOD
2005
ACM
150views Database» more  SIGMOD 2005»
14 years 7 months ago
Incremental Maintenance of Path Expression Views
Caching data by maintaining materialized views typically requires updating the cache appropriately to reflect dynamic source updates. Extensive research has addressed the problem ...
Arsany Sawires, Jun'ichi Tatemura, Oliver Po, Divy...
ECCC
2010
80views more  ECCC 2010»
13 years 7 months ago
Query Complexity in Errorless Hardness Amplification
An errorless circuit for a boolean function is one that outputs the correct answer or "don't know" on each input (and never outputs the wrong answer). The goal of e...
Thomas Watson