Sciweavers

4541 search results - page 438 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
WWW
2007
ACM
16 years 5 months ago
Towards efficient dominant relationship exploration of the product items on the web
In recent years, there has been a prevalence of search engines being employed to find useful information in the Web as they efficiently explore hyperlinks between web pages which ...
Zhenglu Yang, Lin Li, Botao Wang, Masaru Kitsurega...
WWW
2007
ACM
16 years 5 months ago
Querying and maintaining a compact XML storage
As XML database sizes grow, the amount of space used for storing the data and auxiliary data structures becomes a major factor in query and update performance. This paper presents...
Raymond K. Wong, Franky Lam, William M. Shui
PODS
2006
ACM
216views Database» more  PODS 2006»
16 years 5 months ago
Cache-oblivious string B-trees
B-trees are the data structure of choice for maintaining searchable data on disk. However, B-trees perform suboptimally ? when keys are long or of variable length, ? when keys are...
Michael A. Bender, Martin Farach-Colton, Bradley C...
ICNP
2006
IEEE
15 years 11 months ago
DPTree: A Balanced Tree Based Indexing Framework for Peer-to-Peer Systems
— Peer-to-peer (P2P) systems have been widely used for exchange of voluminous information and resources among thousands or even millions of users. Since shared data are normally ...
Mei Li, Wang-Chien Lee, Anand Sivasubramaniam
VC
2008
143views more  VC 2008»
15 years 4 months ago
A single-pass GPU ray casting framework for interactive out-of-core rendering of massive volumetric datasets
We present an adaptive out-of-core technique for rendering massive scalar volumes employing single pass GPU raycasting. The method is based on the decomposition of a volumetric dat...
Enrico Gobbetti, Fabio Marton, José Antonio...