Sciweavers

342 search results - page 30 / 69
» Conjunctive Queries over Trees
Sort
View
WEA
2007
Springer
104views Algorithms» more  WEA 2007»
14 years 1 months ago
Dynamic Trees in Practice
Dynamic tree data structures maintain forests that change over time through edge insertions and deletions. Besides maintaining connectivity information in logarithmic time, they ca...
Robert Endre Tarjan, Renato Fonseca F. Werneck
PVLDB
2010
151views more  PVLDB 2010»
13 years 6 months ago
Advanced Processing for Ontological Queries
Ontology-based data access is a powerful form of extending database technology, where a classical extensional database (EDB) is enhanced by an ontology that generates new intensio...
Andrea Calì, Georg Gottlob, Andreas Pieris
SMI
2005
IEEE
14 years 1 months ago
Subdomain Aware Contour Trees and Contour Evolution in Time-Dependent Scalar Fields
For time-dependent scalar fields, one is often interested in topology changes of contours in time. In this paper, we focus on describing how contours split and merge over a certa...
Andrzej Szymczak
AAAI
2007
13 years 10 months ago
Answering Regular Path Queries in Expressive Description Logics: An Automata-Theoretic Approach
Expressive Description Logics (DLs) have been advocated as formalisms for modeling the domain of interest in various application areas. An important requirement is the ability to ...
Diego Calvanese, Thomas Eiter, Magdalena Ortiz
SSDBM
2007
IEEE
111views Database» more  SSDBM 2007»
14 years 2 months ago
Duplicate Elimination in Space-partitioning Tree Indexes
Space-partitioning trees, like the disk-based trie, quadtree, kd-tree and their variants, are a family of access methods that index multi-dimensional objects. In the case of index...
Mohamed Y. Eltabakh, Mourad Ouzzani, Walid G. Aref