Sciweavers

329 search results - page 20 / 66
» Efficient Parallel Query Processing by Graph Ranking
Sort
View
WWW
2009
ACM
14 years 9 months ago
Using graphics processors for high performance IR query processing
Web search engines are facing formidable performance challenges as they need to process thousands of queries per second over billions of documents. To deal with this heavy workloa...
Shuai Ding, Jinru He, Hao Yan, Torsten Suel
BTW
2007
Springer
153views Database» more  BTW 2007»
14 years 13 days ago
Efficient Time-Travel on Versioned Text Collections
: The availability of versioned text collections such as the Internet Archive opens up opportunities for time-aware exploration of their contents. In this paper, we propose time-tr...
Klaus Berberich, Srikanta J. Bedathur, Gerhard Wei...
ICDE
2003
IEEE
114views Database» more  ICDE 2003»
14 years 9 months ago
Ranked Join Indices
A plethora of data sources contain data entities that could be ordered according to a variety of attributes associated with the entities. Such orderings result effectively in a ra...
Panayiotis Tsaparas, Themistoklis Palpanas, Yannis...
SIGMOD
2009
ACM
175views Database» more  SIGMOD 2009»
14 years 8 months ago
Ranking distributed probabilistic data
Ranking queries are essential tools to process large amounts of probabilistic data that encode exponentially many possible deterministic instances. In many applications where unce...
Feifei Li, Ke Yi, Jeffrey Jestes
ICDE
2005
IEEE
86views Database» more  ICDE 2005»
14 years 9 months ago
Personalized Queries under a Generalized Preference Model
Query Personalization is the process of dynamically enhancing a query with related user preferences stored in a user profile with the aim of providing personalized answers. The un...
Georgia Koutrika, Yannis E. Ioannidis