Sciweavers

48 search results - page 2 / 10
» PBiTree Coding and Efficient Processing of Containment Joins
Sort
View
EDBTW
2006
Springer
13 years 9 months ago
Hash-Based Structural Join Algorithms
Abstract. Algorithms for processing Structural Joins embody essential building blocks for XML query evaluation. Their design is a difficult task, because they have to satisfy many ...
Christian Mathis, Theo Härder
DASFAA
2006
IEEE
183views Database» more  DASFAA 2006»
14 years 2 days ago
Probabilistic Similarity Join on Uncertain Data
An important database primitive for commonly used feature databases is the similarity join. It combines two datasets based on some similarity predicate into one set such that the n...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
CIKM
2004
Springer
13 years 9 months ago
Efficient processing of XML twig patterns with parent child edges: a look-ahead approach
With the growing importance of semi-structure data in information exchange, much research has been done to provide an effective mechanism to match a twig query in an XML database....
Jiaheng Lu, Ting Chen, Tok Wang Ling
EDBT
2008
ACM
154views Database» more  EDBT 2008»
14 years 6 months ago
Ring-constrained join: deriving fair middleman locations from pointsets via a geometric constraint
We introduce a novel spatial join operator, the ring-constrained join (RCJ). Given two sets P and Q of spatial points, the result of RCJ consists of pairs p, q (where p P, q Q) ...
Man Lung Yiu, Panagiotis Karras, Nikos Mamoulis
AVSS
2009
IEEE
13 years 3 months ago
A Classification Architecture Based on Connected Components for Text Detection in Unconstrained Environments
The paper presents a method for efficient text detection in unconstrained environments, based on image features derived from connected components and on a classification architect...
Luca Zini, Augusto Destrero, Francesca Odone