Sciweavers

328 search results - page 58 / 66
» Graph Algebras for Bigraphs
Sort
View
DASFAA
2004
IEEE
92views Database» more  DASFAA 2004»
13 years 11 months ago
Modeling Temporally Variable Transportation Networks
In this paper, a State-Based Dynamic Transportation Network (SBDTN) model is presented, which can be used to describe the spatiotemporal aspect of temporally variable transportatio...
Zhiming Ding, Ralf Hartmut Güting
DKE
2006
79views more  DKE 2006»
13 years 7 months ago
Schema versioning in data warehouses: Enabling cross-version querying via schema augmentation
As several mature implementations of data warehousing systems are fully operational, a crucial role in preserving their up-to-dateness is played by the ability to manage the chang...
Matteo Golfarelli, Jens Lechtenbörger, Stefan...
JDA
2006
184views more  JDA 2006»
13 years 7 months ago
Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...
Camil Demetrescu, Giuseppe F. Italiano
WWW
2007
ACM
14 years 8 months ago
SPARQ2L: towards support for subgraph extraction queries in rdf databases
Many applications in analytical domains often have the need to "connect the dots" i.e., query about the structure of data. In bioinformatics for example, it is typical t...
Kemafor Anyanwu, Angela Maduko, Amit P. Sheth
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
14 years 8 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine