94 search results - page 5 / 19 » Scalable Precomputed Search Trees |
BIRD
2007
Springer
14 years 1 months ago
2007
Springer
We investigate indexing techniques for sequence data, crucial in a wide variety of applications, where efficient, scalable, and versatile search algorithms are required. Recent res...
AISC
2006
Springer
13 years 11 months ago
2006
Springer
We present a search engine for mathematical formulae. The MathWebSearch system harvests the web for content representations (currently MathML and OpenMath) of formulae and indexes ...
SIGMOD
2004
ACM
14 years 7 months ago
2004
ACM
Peer data management systems (PDMS) offer a flexible architecture for decentralized data sharing. In a PDMS, every peer is associated with a schema that represents the peer's...
CIKM
2005
Springer
14 years 1 months ago
2005
Springer
We study suitable indexing techniques to support efficient exact match search in large biological sequence databases. We propose a suffix tree (ST) representation, called STA-DF, ...
WWW
2005
ACM
14 years 8 months ago
2005
ACM
Focused crawlers are considered as a promising way to tackle the scalability problem of topic-oriented or personalized search engines. To design a focused crawler, the choice of s...