Sciweavers

1376 search results - page 46 / 276
» Searching Trees: An Essay
Sort
View
VLDB
2000
ACM
114views Database» more  VLDB 2000»
15 years 3 months ago
The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation
We propose a novel index structure, A-tree (Approximation tree), for similarity search of high-dimensional data. The basic idea of the
Yasushi Sakurai, Masatoshi Yoshikawa, Shunsuke Uem...
CIIT
2004
15 years 1 months ago
Speeding up keyword search for search engines
In the current information age, the dominant method for information search is by providing few keywords to a search engine. Keyword search is currently one of the most important o...
Sanjay Baberwal, Ben Choi
SODA
1990
ACM
173views Algorithms» more  SODA 1990»
15 years 1 months ago
Suffix Arrays: A New Method for On-Line String Searches
A new and conceptually simple data structure, called a suffix array, for on-line string searches is introduced in this paper. Constructing and querying suffix arrays is reduced to...
Udi Manber, Gene Myers
SIGMOD
2005
ACM
161views Database» more  SIGMOD 2005»
15 years 12 months ago
Efficient Keyword Search for Smallest LCAs in XML Databases
Keyword search is a proven, user-friendly way to query HTML documents in the World Wide Web. We propose keyword search in XML documents, modeled as labeled trees, and describe cor...
Yu Xu, Yannis Papakonstantinou
WWW
2007
ACM
16 years 15 days ago
Integrating web directories by learning their structures
Documents in the Web are often organized using category trees by information providers (e.g. CNN, BBC) or search engines (e.g. Google, Yahoo!). Such category trees are commonly kn...
Christopher C. Yang, Jianfeng Lin