Sciweavers

931 search results - page 126 / 187
» Storage and Querying of E-Commerce Data
Sort
View
KDD
2003
ACM
217views Data Mining» more  KDD 2003»
14 years 9 months ago
Algorithms for estimating relative importance in networks
Large and complex graphs representing relationships among sets of entities are an increasingly common focus of interest in data analysis--examples include social networks, Web gra...
Scott White, Padhraic Smyth
PODS
2006
ACM
216views Database» more  PODS 2006»
14 years 9 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...
DAGSTUHL
2004
13 years 10 months ago
The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Y...
SIGMOD
2007
ACM
187views Database» more  SIGMOD 2007»
14 years 9 months ago
P-ring: an efficient and robust P2P range index structure
Data availability, collection and storage have increased dramatically in recent years, raising new technological and algorithmic challenges for database design and data management...
Adina Crainiceanu, Prakash Linga, Ashwin Machanava...
ICDE
2009
IEEE
166views Database» more  ICDE 2009»
14 years 10 months ago
Supporting Database Applications as a Service
Abstract-- Multi-tenant data management is a form of Software as a Service (SaaS), whereby a third party service provider hosts databases as a service and provides its customers wi...
Mei Hui, Dawei Jiang, Guoliang Li, Yuan Zhou