Sciweavers

2859 search results - page 80 / 572
» Querying Complex Structured Databases
Sort
View
COLING
1996
13 years 9 months ago
Error-tolerant Tree Matching
This paper presents an efficient algorithm for retrieving from a database of trees, all trees that match a given query tree appro,imately, that is, within a certain error toleranc...
Kemal Oflazer
EDBT
2009
ACM
241views Database» more  EDBT 2009»
14 years 2 months ago
GADDI: distance index based subgraph matching in biological networks
Currently, a huge amount of biological data can be naturally represented by graphs, e.g., protein interaction networks, gene regulatory networks, etc. The need for indexing large ...
Shijie Zhang, Shirong Li, Jiong Yang
CIKM
2004
Springer
14 years 1 months ago
Organizing structured web sources by query schemas: a clustering approach
In the recent years, the Web has been rapidly “deepened” with the prevalence of databases online. On this deep Web, many sources are structured by providing structured query i...
Bin He, Tao Tao, Kevin Chen-Chuan Chang
EDBT
2008
ACM
178views Database» more  EDBT 2008»
14 years 8 months ago
An inductive database and query language in the relational model
In the demonstration, we will present the concepts and an implementation of an inductive database ? as proposed by Imielinski and Mannila ? in the relational model. The goal is to...
Lothar Richter, Jörg Wicker, Kristina Kessler...
ICDE
2009
IEEE
156views Database» more  ICDE 2009»
14 years 9 months ago
Distributed Structural Relaxation of XPath Queries
Due to the structural heterogeneity of XML, queries are often interpreted approximately. This is achieved by relaxing the query and ranking the results based on their relevance to ...
Georgia Koloniari, Evaggelia Pitoura