294 search results - page 36 / 59 » Answering Regular Path Queries Using Views |
DMDW
2000
13 years 8 months ago
2000
As views in a data warehouse become more complex, the view maintenance process can become very complicated and potentially very inefficient. Storing auxiliary views in the warehou...
SIGMOD
2008
ACM
14 years 7 months ago
2008
ACM
As peer-to-peer (P2P) networks become more familiar to the database community, intense interest has built up in using their scalability and resilience properties to scale database...
KDD
2004
ACM
14 years 23 days ago
2004
ACM
Many real-world graphs have been shown to be scale-free— vertex degrees follow power law distributions, vertices tend to cluster, and the average length of all shortest paths is...
ICDE
2008
IEEE
14 years 8 months ago
2008
IEEE
We study new hierarchical indexing approach to process XPATH queries. Here, a hierarchical index consists of index entries that are pairs of queries and their (full/partial) answer...
EDBT
2012
ACM
11 years 9 months ago
2012
ACM
In this paper we consider the problem of answering queries using views, with or without ontological constraints, which is important for data integration, query optimization, and d...