Sciweavers

3122 search results - page 321 / 625
» Storing Semistructured Data with STORED
Sort
View
183
Voted
FOCS
2000
IEEE
15 years 11 months ago
Opportunistic Data Structures with Applications
There is an upsurging interest in designing succinct data structures for basic searching problems (see [23] and references therein). The motivation has to be found in the exponent...
Paolo Ferragina, Giovanni Manzini
KDD
2010
ACM
232views Data Mining» more  KDD 2010»
15 years 10 months ago
Discovering frequent patterns in sensitive data
Discovering frequent patterns from data is a popular exploratory technique in data mining. However, if the data are sensitive (e.g. patient health records, user behavior records) ...
Raghav Bhaskar, Srivatsan Laxman, Adam Smith, Abhr...
SODA
2004
ACM
102views Algorithms» more  SODA 2004»
15 years 8 months ago
The hyperring: a low-congestion deterministic data structure for distributed environments
In this paper we study the problem of designing concurrent searchable data structures with performance guarantees that can be used in a distributed environment where data elements...
Baruch Awerbuch, Christian Scheideler
SIGMOD
2008
ACM
103views Database» more  SIGMOD 2008»
16 years 6 months ago
XArch: archiving scientific and reference data
Database archiving is important for the retrieval of old versions of a database and for temporal queries over the history of data. We demonstrate XArch, a management system for ma...
Heiko Müller, Ioannis Koltsidas, Peter Bunema...
GRID
2004
Springer
16 years 2 days ago
Parallel and Distributed Astronomical Data Analysis on Grid Datafarm
A comprehensive study of the whole petabyte-scale archival data of astronomical observatories has a possibility of new science and new knowledge in the field, while it was not fe...
Naotaka Yamamoto, Osamu Tatebe, Satoshi Sekiguchi