2217 search results - page 247 / 444 » Rank-aware Query Optimization |
197
click to vote
INFOCOM
2006
IEEE
16 years 15 days ago
2006
IEEE
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
164
click to vote
SIGECOM
2010
ACM
15 years 11 months ago
2010
ACM
Product recommendation and decision support systems must generally develop a model of user preferences by querying or otherwise interacting with a user. Recent approaches to elici...
161
click to vote
SIGMOD
1998
ACM
15 years 10 months ago
1998
ACM
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...
214
click to vote
DPD
2006
15 years 6 months ago
2006
A common technique used to minimize I/O in data intensive applications is data declustering over parallel servers. This technique involves distributing data among several disks so...
148
click to vote
ATMOS
2008
15 years 8 months ago
2008
We present an extension of the well-known time-expanded approach for timetable information. By remodeling unimportant stations, we are able to obtain faster query times with less s...