Sciweavers

242 search results - page 25 / 49
» An Efficient Method for Indexing Now-relative Bitemporal dat...
Sort
View
CIKM
2008
Springer
13 years 9 months ago
TinyLex: static n-gram index pruning with perfect recall
Inverted indexes using sequences of characters (n-grams) as terms provide an error-resilient and language-independent way to query for arbitrary substrings and perform approximate...
Derrick Coetzee
DBISP2P
2006
Springer
195views Database» more  DBISP2P 2006»
13 years 11 months ago
XML Query Routing in Structured P2P Systems
Abstract. This paper addresses the problem of data placement, indexing, and querying large XML data repositories distributed over an existing P2P service infrastructure. Our archit...
Leonidas Fegaras, Weimin He, Gautam Das, David Lev...
CCGRID
2003
IEEE
13 years 11 months ago
Improving Access to Multi-dimensional Self-describing Scientific Dataset
Applications that query into very large multidimensional datasets are becoming more common. Many self-describing scientific data file formats have also emerged, which have structu...
Beomseok Nam, Alan Sussman
TKDE
2008
171views more  TKDE 2008»
13 years 7 months ago
Efficient Similarity Search in Nonmetric Spaces with Local Constant Embedding
Similarity-based search has been a key factor for many applications such as multimedia retrieval, data mining, Web search and retrieval, and so on. There are two important issues r...
Lei Chen 0002, Xiang Lian
ICDE
2003
IEEE
146views Database» more  ICDE 2003»
14 years 9 months ago
Distance Based Indexing for String Proximity Search
In many database applications involving string data, it is common to have near neighbor queries (asking for strings that are similar to a query string) or nearest neighbor queries...
Jai Macker, Murat Tasan, Süleyman Cenk Sahina...