Sciweavers

654 search results - page 15 / 131
» Complexity of Answering Queries Using Materialized Views
Sort
View
VLDB
2000
ACM
122views Database» more  VLDB 2000»
13 years 12 months ago
A Scalable Algorithm for Answering Queries Using Views
Rachel Pottinger, Alon Y. Levy
ICDE
2010
IEEE
212views Database» more  ICDE 2010»
14 years 8 months ago
ViewJoin: Efficient View-based Evaluation of Tree Pattern Queries
A fundamental problem in XML query processing is tree pattern query (TPQ) matching which computes all data instances in an XML database that match an input TPQ. There is a lot of r...
Ding Chen, Chee-Yong Chan
CIKM
2010
Springer
13 years 7 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
DASFAA
2009
IEEE
96views Database» more  DASFAA 2009»
14 years 3 months ago
Materialized View Selection in XML Databases
Materialized views, a rdbms silver bullet, demonstrate its efficacy in many applications, especially as a data warehousing/decison support system tool. The pivot of playing materia...
Nan Tang, Jeffrey Xu Yu, Hao Tang, M. Tamer Ö...
CORR
2010
Springer
160views Education» more  CORR 2010»
13 years 8 months ago
Scalable Probabilistic Databases with Factor Graphs and MCMC
Incorporating probabilities into the semantics of incomplete databases has posed many challenges, forcing systems to sacrifice modeling power, scalability, or treatment of relatio...
Michael L. Wick, Andrew McCallum, Gerome Miklau