Sciweavers

54 search results - page 10 / 11
» Dynamic index selection in data warehouses
Sort
View
BTW
2007
Springer
142views Database» more  BTW 2007»
14 years 1 months ago
Algebraic Query Optimization for Distributed Top-k Queries
: Distributed top-k query processing is increasingly becoming an essential functionality in a large number of emerging application classes. This paper addresses the efficient alge...
Thomas Neumann, Sebastian Michel
APCSAC
2005
IEEE
14 years 1 months ago
Irregular Redistribution Scheduling by Partitioning Messages
Abstract. Dynamic data redistribution enhances data locality and improves algorithm performance for numerous scientific problems on distributed memory multi-computers systems. Prev...
Chang Yu, Ching-Hsien Hsu, Kun-Ming Yu, Chiu-Kuo L...
BTW
2011
Springer
218views Database» more  BTW 2011»
12 years 11 months ago
Tracking Hot-k Items over Web 2.0 Streams
Abstract: The rise of the Web 2.0 has made content publishing easier than ever. Yesterday’s passive consumers are now active users who generate and contribute new data to the web...
Parisa Haghani, Sebastian Michel, Karl Aberer
APWEB
2010
Springer
14 years 6 days ago
Optimizing Query Processing for the Hidden Web
Abstract. The term Deep Web (sometimes also called Hidden Web) refers to the data content that is created dynamically as the result of a specific search on the Web. In this respec...
Andrea Calì, Davide Martinenghi
WWW
2005
ACM
14 years 8 months ago
User-centric Web crawling
Search engines are the primary gateways of information access on the Web today. Behind the scenes, search engines crawl the Web to populate a local indexed repository of Web pages...
Sandeep Pandey, Christopher Olston