Sciweavers

3122 search results - page 382 / 625
» Storing Semistructured Data with STORED
Sort
View
CINQ
2004
Springer
163views Database» more  CINQ 2004»
15 years 12 months ago
Frequent Itemset Discovery with SQL Using Universal Quantification
Algorithms for finding frequent itemsets fall into two broad classes: (1) algorithms that are based on non-trivial SQL statements to query and update a database, and (2) algorithms...
Ralf Rantzau
ICS
2004
Tsinghua U.
15 years 12 months ago
Cluster prefetch: tolerating on-chip wire delays in clustered microarchitectures
The growing dominance of wire delays at future technology points renders a microprocessor communication-bound. Clustered microarchitectures allow most dependence chains to execute...
Rajeev Balasubramonian
SSDBM
2002
IEEE
122views Database» more  SSDBM 2002»
15 years 11 months ago
ATreeGrep: Approximate Searching in Unordered Trees
An unordered labeled tree is a tree in which each node has a string label and the parent-child relationship is significant, but the order among siblings is unimportant. This pape...
Dennis Shasha, Jason Tsong-Li Wang, Huiyuan Shan, ...
ICA3PP
2009
Springer
15 years 11 months ago
A Software Transactional Memory Service for Grids
In-memory data sharing for grids allow location-transparent access to data stored in volatile memory. Existing Grid middlewares typ- ically support only explicit data transfer betw...
Kim-Thomas Möller, Marc-Florian Müller, ...
ICDCS
1999
IEEE
15 years 11 months ago
The Swarm Scalable Storage System
Swarm is a storage system that provides scalable, reliable, and cost-effective data storage. Swarm is based on storage servers, rather than file servers; the storage servers are o...
John H. Hartman, Ian Murdock, Tammo Spalink