Sciweavers

78 search results - page 8 / 16
» Compressed Index for Dictionary Matching
Sort
View
SPIRE
2001
Springer
13 years 11 months ago
Compaction Techniques for Nextword Indexes
Most queries to text search engines are ranked or Boolean. Phrase querying is a powerful technique for refining searches, but is expensive to implement on conventional indexes. I...
Dirk Bahle, Hugh E. Williams, Justin Zobel
VLDB
2005
ACM
93views Database» more  VLDB 2005»
14 years 25 days ago
Indexing Mixed Types for Approximate Retrieval
In various applications such as data cleansing, being able to retrieve categorical or numerical attributes based on notions of approximate match (e.g., edit distance, numerical di...
Liang Jin, Nick Koudas, Chen Li, Anthony K. H. Tun...
WWW
2006
ACM
14 years 8 months ago
Compressing and searching XML data via two zips
XML is fast becoming the standard format to store, exchange and publish over the web, and is getting embedded in applications. Two challenges in handling XML are its size (the XML...
Paolo Ferragina, Fabrizio Luccio, Giovanni Manzini...
ICDE
2008
IEEE
129views Database» more  ICDE 2008»
14 years 8 months ago
Hierarchical Indexing Approach to Support XPath Queries
We study new hierarchical indexing approach to process XPATH queries. Here, a hierarchical index consists of index entries that are pairs of queries and their (full/partial) answer...
Jeffrey Xu Yu, Kam-Fai Wong, M. Tamer Özsu, N...
CORR
2010
Springer
200views Education» more  CORR 2010»
13 years 7 months ago
Unified Compression-Based Acceleration of Edit-Distance Computation
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming s...
Danny Hermelin, Gad M. Landau, Shir Landau, Oren W...