486 search results - page 91 / 98 » Evaluating Top-k Queries over Web-Accessible Databases |
EDBT
2009
ACM
15 years 8 months ago
2009
ACM
In a variety of applications, ranging from data integration to distributed query evaluation, there is a need to obtain sets of data items from several sources (peers) and compute ...
118
click to vote
ADBIS
2009
Springer
15 years 8 months ago
2009
Springer
Continuous queries applied over nonterminating data streams usually specify windows in order to obtain an evolving –yet restricted– set of tuples and thus provide timely result...
125
click to vote
ICDE
2007
IEEE
15 years 7 months ago
2007
IEEE
Similarity search usually encounters a serious problem in the high dimensional space, known as the “curse of dimensionality”. In order to speed up the retrieval efficiency, p...
129
click to vote
VLDB
2007
ACM
15 years 7 months ago
2007
ACM
As the Web has evolved into a data-rich repository, with the standard “page view,” current search engines are becoming increasingly inadequate for a wide range of query tasks....
145
click to vote
DASFAA
2006
IEEE
15 years 7 months ago
2006
IEEE
Efficient full-text keyword search remains a challenging problem in P2P systems. Most of the traditional keyword search systems on DHT overlay networks perform the join operation ...