Sciweavers

94 search results - page 2 / 19
» Faster index for property matching
Sort
View
DEXA
2006
Springer
136views Database» more  DEXA 2006»
15 years 4 months ago
Faster Twig Pattern Matching Using Extended Dewey ID
Finding all the occurrences of a twig pattern in an XML database is a core operation for efficient evaluation of XML queries. Recently, Lu et al. [7] proposed the TJFast algorithm ...
Chung Keung Poon, Leo Yuen
131
Voted
PETRA
2009
ACM
15 years 7 months ago
Towards faster activity search using embedding-based subsequence matching
Event search is the problem of identifying events or activity of interest in a large database storing long sequences of activity. In this paper, our topic is the problem of identi...
Panagiotis Papapetrou, Paul Doliotis, Vassilis Ath...
SPIRE
2005
Springer
15 years 6 months ago
Faster Generation of Super Condensed Neighbourhoods Using Finite Automata
We present a new algorithm for generating super condensed neighbourhoods. Super condensed neighbourhoods have recently been presented as the minimal set of words that represent a p...
Luís M. S. Russo, Arlindo L. Oliveira
95
Voted
CIKM
2009
Springer
15 years 5 months ago
Space-economical partial gram indices for exact substring matching
Exact substring matching queries on large data collections can be answered using q-gram indices, that store for each occurring q-byte pattern an (ordered) posting list with the po...
Nan Tang, Lefteris Sidirourgos, Peter A. Boncz
86
Voted
BIRD
2008
Springer
177views Bioinformatics» more  BIRD 2008»
15 years 2 months ago
Fast Structured Motif Search in DNA Sequences
We study the problem of structured motif search in DNA sequences. This is a fundamental task in bioinformatics which contributes to better understanding of genome characteristics a...
Mihail Halachev, Nematollaah Shiri