Sciweavers

5144 search results - page 174 / 1029
» Enhancing Search with Structure
Sort
View
EDBT
2004
ACM
119views Database» more  EDBT 2004»
16 years 4 months ago
NNH: Improving Performance of Nearest-Neighbor Searches Using Histograms
Efficient search for nearest neighbors (NN) is a fundamental problem arising in a large variety of applications of vast practical interest. In this paper we propose a novel techniq...
Liang Jin, Nick Koudas, Chen Li
SIGMOD
2008
ACM
119views Database» more  SIGMOD 2008»
16 years 4 months ago
Webpage understanding: beyond page-level search
In this paper we introduce the webpage understanding problem which consists of three subtasks: webpage segmentation, webpage structure labeling, and webpage text segmentation and ...
Zaiqing Nie, Ji-Rong Wen, Wei-Ying Ma
SIGMOD
1997
ACM
146views Database» more  SIGMOD 1997»
15 years 8 months ago
Concurrency and Recovery in Generalized Search Trees
This paper presents general algorithms for concurrency control in tree-based access methods as well as a recovery protocol and a mechanism for ensuring repeatable read. The algori...
Marcel Kornacker, C. Mohan, Joseph M. Hellerstein
124
Voted
ESA
2010
Springer
140views Algorithms» more  ESA 2010»
15 years 5 months ago
A Unified Approach to Approximate Proximity Searching
The inability to answer proximity queries efficiently for spaces of dimension d > 2 has led to the study of approximation to proximity problems. Several techniques have been pro...
Sunil Arya, Guilherme Dias da Fonseca, David M. Mo...
EDBT
2006
ACM
112views Database» more  EDBT 2006»
16 years 4 months ago
Expressiveness and Performance of Full-Text Search Languages
We study the expressiveness and performance of full-text search languages. Our main motivation is to provide a formal basis for comparing such languages and to develop a model for...
Chavdar Botev, Sihem Amer-Yahia, Jayavel Shanmugas...