Sciweavers

2001 search results - page 148 / 401
» Indexing in a Hypertext Database
Sort
View
WEBDB
2004
Springer
81views Database» more  WEBDB 2004»
14 years 3 months ago
Querying Peer-to-Peer Networks Using P-Trees
We propose a new distributed, fault-tolerant peer-to-peer index structure called the P-tree. P-trees efficiently evaluate range queries in addition to equality queries.
Adina Crainiceanu, Prakash Linga, Johannes Gehrke,...
JASIS
2007
125views more  JASIS 2007»
13 years 10 months ago
Approximate personal name-matching through finite-state graphs
cience Abstracts and Science Citation Index Expanded databases. The evaluation involved calculating the measures of precision and recall, based on completeness and accuracy. The re...
Carmen Galvez, Félix de Moya Anegón
ICDE
2010
IEEE
288views Database» more  ICDE 2010»
14 years 10 months ago
Fast In-Memory XPath Search using Compressed Indexes
A large fraction of an XML document typically consists of text data. The XPath query language allows text search via the equal, contains, and starts-with predicates. Such predicate...
Diego Arroyuelo, Francisco Claude, Sebastian Manet...
MM
2004
ACM
208views Multimedia» more  MM 2004»
14 years 3 months ago
Fast and robust video clip search using index structure
Content based retrieval of similar multimedia objects (e.g. images, text, and videos) is an important research issue in the field of multimedia database. In this demo, we present ...
Ling-Yu Duan, Junsong Yuan, Qi Tian, Changsheng Xu
ICDE
2007
IEEE
190views Database» more  ICDE 2007»
14 years 2 months ago
CPS-tree: A Compact Partitioned Suffix Tree for Disk-based Indexing on Large Genome Sequences
Suffix tree is an important data structure for indexing a long sequence (like a genome sequence) or a concatenation of sequences. It finds many applications in practice, especiall...
Swee-Seong Wong, Wing-Kin Sung, Limsoon Wong