Sciweavers

1388 search results - page 87 / 278
» Querying Linguistic Trees
Sort
View
87
Voted
COLING
1996
15 years 1 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
105
Voted
CIKM
2000
Springer
15 years 5 months ago
Object and Query Transformation: Supporting Multi-Dimensional Queries through Code Reuse
The complexity of deploying high-performance spatial structures in transactional DBMS environments has motivated researchers to experiment with the idea of reusing the effort inve...
Ratko Orlandic, Byunggu Yu
CIKM
2007
Springer
15 years 6 months ago
Evaluation of partial path queries on xml data
XML query languages typically allow the specification of structural patterns of elements. Finding the occurrences of such patterns in an XML tree is the key operation in XML quer...
Stefanos Souldatos, Xiaoying Wu, Dimitri Theodorat...
105
Voted
ADBIS
1999
Springer
80views Database» more  ADBIS 1999»
15 years 4 months ago
S*-Tree: An Improved S+-Tree for Coloured Images
In this paper we propose and analyze a new spatial access method, namely the S∗ -tree, for the efficient secondary memory encoding and manipulation of images containing multiple ...
Enrico Nardelli, Guido Proietti
96
Voted
CALCO
2007
Springer
95views Mathematics» more  CALCO 2007»
15 years 6 months ago
Higher Dimensional Trees, Algebraically
In formal language theory, James Rogers published a series of innovative papers generalising strings and trees to higher dimensions.Motivated by applications in linguistics, his go...
Neil Ghani, Alexander Kurz