151 search results - page 14 / 31 » Materializing views with minimal size to answer queries |
CIKM
2010
Springer
13 years 8 months ago
2010
Springer
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...
VLDB
2002
ACM
13 years 9 months ago
2002
ACM
An increasing number of applications use XML data published from relational databases. For speed and convenience, such applications routinely cache this XML data locally and acces...
ICDE
2005
IEEE
14 years 11 months ago
2005
IEEE
Maintaining materialized views that have join conditions between arbitrary pairs of data sources possibly with cycles is critical for many applications. In this work, we model vie...
SIGMOD
2005
ACM
14 years 10 months ago
2005
ACM
Caching data by maintaining materialized views typically requires updating the cache appropriately to reflect dynamic source updates. Extensive research has addressed the problem ...
SPAA
2009
ACM
14 years 10 months ago
2009
ACM
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...