4747 search results - page 747 / 950 » Shuffle Memory System |
166
click to vote
VLDB
2005
ACM
16 years 2 days ago
2005
ACM
This paper presents the design of a read-optimized relational DBMS that contrasts sharply with most current systems, which are write-optimized. Among the many differences in its d...
164
click to vote
WDAG
2005
Springer
16 years 2 days ago
2005
Springer
Abstract. The vast majority of papers on distributed computing assume that processes are assigned unique identifiers before computation begins. But is this assumption necessary? W...
166
click to vote
APLAS
2004
ACM
2004
ACM
Translation of Tree-Processing Programs into Stream-Processing Programs Based on Ordered Linear Type
16 years 18 hour ago
There are two ways to write a program for manipulating tree-structured data such as XML documents: One is to write a tree-processing program focusing on the logical structure of t...
179
click to vote
MM
2004
ACM
16 years 14 hour ago
2004
ACM
Given time and location information about digital photographs we can automatically generate an abundance of related contextual metadata, using off-the-shelf and Web-based data so...
171
click to vote
DEXA
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. In relational database management systems indexes are used to accelerate specific queries. The selection of indexes is an important task when tuning a database which is ...