Sciweavers

14 search results - page 3 / 3
» Sorting And Indexing With Partitioned B-Trees
Sort
View
ALGORITHMICA
1999
112views more  ALGORITHMICA 1999»
13 years 5 months ago
Suffix Trees on Words
We discuss an intrinsic generalization of the suffix tree, designed to index a string of length n which has a natural partitioning into m multicharacter substrings or words. This ...
Arne Andersson, N. Jesper Larsson, Kurt Swanson
ICDE
2003
IEEE
120views Database» more  ICDE 2003»
14 years 6 months ago
PBiTree Coding and Efficient Processing of Containment Joins
This paper addresses issues related to containment join processing in tree-structured data such as XML documents. A containment join takes two sets of XML node elements as input a...
Wei Wang 0011, Haifeng Jiang, Hongjun Lu, Jeffrey ...
CIVR
2007
Springer
185views Image Analysis» more  CIVR 2007»
13 years 11 months ago
Z-grid-based probabilistic retrieval for scaling up content-based copy detection
Scalability is the key issue in making content-based copy detection (CBCD) methods practical for very large image and video databases. Since copies are transformed versions of ori...
Sébastien Poullot, Olivier Buisson, Michel ...
PEPM
2010
ACM
14 years 2 months ago
Optimizing relational algebra operations using generic equivalence discriminators and lazy products
We show how to efficiently evaluate generic map-filter-product queries, generalizations of select-project-join (SPJ) queries in relational algebra, based on a combination of two...
Fritz Henglein