Sciweavers

589 search results - page 62 / 118
» Optimized Query Evaluation Using Cooperative Sorts
Sort
View
SODA
2004
ACM
137views Algorithms» more  SODA 2004»
14 years 11 months ago
The Bloomier filter: an efficient data structure for static support lookup tables
We introduce the Bloomier filter, a data structure for compactly encoding a function with static support in order to support approximate evaluation queries. Our construction gener...
Bernard Chazelle, Joe Kilian, Ronitt Rubinfeld, Ay...
SIGMOD
1998
ACM
97views Database» more  SIGMOD 1998»
15 years 2 months ago
Cost Based Query Scrambling for Initial Delays
Remote data access from disparate sources across a widearea network such as the Internet is problematic due to the unpredictable nature of the communications medium and the lack o...
Tolga Urhan, Michael J. Franklin, Laurent Amsaleg
SIGMOD
1998
ACM
143views Database» more  SIGMOD 1998»
15 years 2 months ago
Optimal Multi-Step k-Nearest Neighbor Search
For an increasing number of modern database applications, efficient support of similarity search becomes an important task. Along with the complexity of the objects such as images...
Thomas Seidl, Hans-Peter Kriegel
GECCO
2007
Springer
283views Optimization» more  GECCO 2007»
15 years 4 months ago
Evolving Lucene search queries for text classification
We describe a method for generating accurate, compact, human understandable text classifiers. Text datasets are indexed using Apache Lucene and Genetic Programs are used to constr...
Laurence Hirsch, Robin Hirsch, Masoud Saeedi
MIDDLEWARE
2005
Springer
15 years 3 months ago
Adaptive query processing in mobile environment
These last years, the evolution of nomadic terminals and mobile networks has yield to the development of the ubiquitous computing. In this context, actual query evaluation and opt...
Hocine Grine, Thierry Delot, Sylvain Lecomte