5 search results - page 1 / 1 » Computing the top-k maximal answers in a join of ranked list... |
VLDB
2007
ACM
13 years 10 months ago
2007
ACM
In many applications, the underlying data (the web, an XML document, or a relational database) can be seen as a graph. These graphs may be enriched with weights, associated with t...
CIKM
2010
Springer
13 years 2 months ago
2010
Springer
Complex search tasks that utilize information from several data sources, are answered by integrating the results of distinct basic search queries. In such integration, each basic ...
WSDM
2009
ACM
13 years 11 months ago
2009
ACM
There has been considerable past work on efficiently computing top k objects by aggregating information from multiple ranked lists of these objects. An important instance of this...
SSDBM
2007
IEEE
13 years 11 months ago
2007
IEEE
As relational database management systems are applied to non-traditional domains such as scientific data management, there is an increasing need to support queries with semantics ...
GIS
2008
ACM
13 years 5 months ago
2008
ACM
In a geographical route search, given search terms, the goal is to find an effective route that (1) starts at a given location, (2) ends at a given location, and (3) travels via...