Sciweavers

1101 search results - page 82 / 221
» Scalable Distributed Data Structures for High-Performance Da...
Sort
View
139
Voted
HPDC
2000
IEEE
15 years 7 months ago
Creating Large Scale Database Servers
The BaBar experiment at the Stanford Linear Accelerator Center (SLAC) is designed to perform a high precision investigation of the decays of the B-meson produced from electron-pos...
Jacek Becla, Andrew Hanushevsky
191
Voted
SIGMOD
1999
ACM
183views Database» more  SIGMOD 1999»
15 years 6 months ago
OPTICS: Ordering Points To Identify the Clustering Structure
Cluster analysis is a primary method for database mining. It is either used as a stand-alone tool to get insight into the distribution of a data set, e.g. to focus further analysi...
Mihael Ankerst, Markus M. Breunig, Hans-Peter Krie...
ICC
2007
IEEE
116views Communications» more  ICC 2007»
15 years 9 months ago
Skip Tree Graph: a Distributed and Balanced Search Tree for Peer-to-Peer Networks
Abstract—Skip Tree Graph is a novel, distributed, data structure for peer-to-peer systems that supports exact-match and order-based queries such as range queries efficiently. It...
Alejandra González Beltrán, Paul Sag...
126
Voted
CIKM
2009
Springer
15 years 9 months ago
Incremental query evaluation for support vector machines
Support vector machines (SVMs) have been widely used in multimedia retrieval to learn a concept in order to find the best matches. In such a SVM active learning environment, the ...
Danzhou Liu, Kien A. Hua
120
Voted
ER
2006
Springer
123views Database» more  ER 2006»
15 years 6 months ago
A Quantitative Summary of XML Structures
Statistical summaries in relational databases mainly focus on the distribution of data values and have been found useful for various applications, such as query evaluation and data...
Zi Lin, Bingsheng He, Byron Choi