610 search results - page 87 / 122 » Efficient Query Evaluation on Probabilistic Databases |
115
Voted
DEXA
2010
Springer
15 years 1 months ago
2010
Springer
The class of k Nearest Neighbor (kNN) queries in spatial networks has been widely studied in the literature. All existing approaches for kNN search in spatial networks assume that ...
WWW
2004
ACM
16 years 1 months ago
2004
ACM
Maximizing only the relevance between queries and documents will not satisfy users if they want the top search results to present a wide coverage of topics by a few representative...
94
Voted
VLDB
2004
ACM
15 years 6 months ago
2004
ACM
Focused web crawlers have recently emerged as an alternative to the well-established web search engines. While the well-known focused crawlers retrieve relevant webpages, there ar...
121
Voted
VLDB
1997
ACM
15 years 4 months ago
1997
ACM
A new access method, called M-tree, is proposed to organize and search large data sets from a generic "metric space", i.e. where object proximity is only defined by a di...
119
Voted
DEBU
2008
15 years 23 days ago
2008
The Pathfinder project makes inventive use of relational database technology--originally developed to process data of strictly tabular shape--to construct efficient database-suppo...