Sciweavers

737 search results - page 47 / 148
» Improving Access to Large Volumes of Online Data
Sort
View
WWW
2005
ACM
16 years 2 months ago
CubeSVD: a novel approach to personalized Web search
As the competition of Web search market increases, there is a high demand for personalized Web search to conduct retrieval incorporating Web users' information needs. This pa...
Jian-Tao Sun, Hua-Jun Zeng, Huan Liu, Yuchang Lu, ...
SPAA
2004
ACM
15 years 7 months ago
Online algorithms for prefetching and caching on parallel disks
Parallel disks provide a cost effective way of speeding up I/Os in applications that work with large amounts of data. The main challenge is to achieve as much parallelism as poss...
Rahul Shah, Peter J. Varman, Jeffrey Scott Vitter
ICDE
2007
IEEE
127views Database» more  ICDE 2007»
16 years 3 months ago
Supporting Streaming Updates in an Active Data Warehouse
Active Data Warehousing has emerged as an alternative to conventional warehousing practices in order to meet the high demand of applications for up-to-date information. In a nutsh...
Neoklis Polyzotis, Spiros Skiadopoulos, Panos Vass...
WABI
2004
Springer
109views Bioinformatics» more  WABI 2004»
15 years 7 months ago
Online Consensus and Agreement of Phylogenetic Trees
Computational heuristics are the primary methods for reconstruction of phylogenetic trees on large datasets. Most large-scale phylogenetic analyses produce numerous trees that are ...
Tanya Y. Berger-Wolf
WWW
2005
ACM
16 years 2 months ago
Three-level caching for efficient query processing in large Web search engines
Large web search engines have to answer thousands of queries per second with interactive response times. Due to the sizes of the data sets involved, often in the range of multiple...
Xiaohui Long, Torsten Suel