Sciweavers

2859 search results - page 16 / 572
» Querying Complex Structured Databases
Sort
View
DATESO
2009
101views Database» more  DATESO 2009»
13 years 5 months ago
Using Top Trees For Easy Programming of Tree Algorithms
Top trees are a dynamic self-adjusting data structure that can be used by any tree algorithm. Actually, an arbitrary number of different tree algorithms can use a single structure....
Michal Vajbar
VLDB
1991
ACM
141views Database» more  VLDB 1991»
13 years 11 months ago
Efficiency of Nested Relational Document Database Systems
Systems designed for efficient retrieval of conventional data can be very inefficient at retrieving documents. Documents have more complex structure than conventional data, and th...
Justin Zobel, James A. Thom, Ron Sacks-Davis
DASFAA
2008
IEEE
149views Database» more  DASFAA 2008»
14 years 2 months ago
Index-Supported Similarity Search Using Multiple Representations
Similarity search in complex databases is of utmost interest in a wide range of application domains. Often, complex objects are described by several representations. The combinatio...
Johannes Aßfalg, Michael Kats, Hans-Peter Kr...
DILS
2006
Springer
13 years 11 months ago
On Querying OBO Ontologies Using a DAG Pattern Query Language
The Open Biomedical Ontologies (OBO) is a consortium that serves as a repository of ontologies that are structured like directed acyclic graphs. In this paper we present a language...
Amarnath Gupta, Simone Santini
ICDE
2010
IEEE
273views Database» more  ICDE 2010»
14 years 7 months ago
WikiAnalytics: Ad-hoc Querying of Highly Heterogeneous Structured Data
Searching and extracting meaningful information out of highly heterogeneous datasets is a hot topic that received a lot of attention. However, the existing solutions are based on e...
Andrey Balmin, Emiran Curtmola