Sciweavers

294 search results - page 13 / 59
» Answering Regular Path Queries Using Views
Sort
View
EDBT
2000
ACM
14 years 1 days ago
Navigation-Driven Evaluation of Virtual Mediated Views
The MIX mediator systems incorporates a novel framework for navigation-driven evaluation of virtual mediated views. Its architecture allows the on-demand computation of views and q...
Bertram Ludäscher, Yannis Papakonstantinou, P...
DATESO
2010
184views Database» more  DATESO 2010»
13 years 6 months ago
iXUPT: Indexing XML Using Path Templates
The XML format has become the standard for data exchange because it is self-describing and it stores not only information but also the relationships between data. Therefore it is u...
Tomás Bartos, Ján Kasarda
ISAAC
2005
Springer
118views Algorithms» more  ISAAC 2005»
14 years 1 months ago
External Data Structures for Shortest Path Queries on Planar Digraphs
In this paper we present space-query trade-offs for external memory data structures that answer shortest path queries on planar directed graphs. For any S = Ω(N1+ ) and S = O(N2...
Lars Arge, Laura Toma
SIGMOD
2005
ACM
150views Database» more  SIGMOD 2005»
14 years 8 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...
VLDB
2002
ACM
157views Database» more  VLDB 2002»
14 years 8 months ago
A formal perspective on the view selection problem
The view selection problem is to choose a set of views to materialize over a database schema, such that the cost of evaluating a set of workload queries is minimized and such that ...
Rada Chirkova, Alon Y. Halevy, Dan Suciu