329 search results - page 15 / 66 » Efficient Parallel Query Processing by Graph Ranking |
182
click to vote
ICDE
2009
IEEE
15 years 11 months ago
2009
IEEE
Keyword queries enjoy widespread usage as they represent an intuitive way of specifying information needs. Recently, answering keyword queries on graph-structured data has emerged ...
CLOUDCOM
2010
Springer
14 years 6 months ago
2010
Springer
Geospatial queries (GQ) have been used in a wide variety of applications such as decision support systems, profile-based marketing, bioinformatics and GIS. Most of the existing qu...
149
click to vote
SIGMOD
2007
ACM
15 years 9 months ago
2007
ACM
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
70
Voted
WWW
2004
ACM
15 years 10 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...
PARLE
1993
15 years 1 months ago
1993
: Parallel database systems aim at providing high throughput for OLTP transactions as well as short response times for complex and data-intensive queries. Shared nothing systems re...