11573 search results - page 1826 / 2315 » Designing Relational Databases |
168
Voted
EDBTW
2010
Springer
15 years 10 months ago
2010
Springer
The vision of dataspaces has been articulated as providing various of the benefits of classical data integration but with reduced up-front costs, which, combined with opportunitie...
153
click to vote
C3S2E
2008
ACM
15 years 8 months ago
2008
ACM
We take another look at the 2DR-tree. In particular, we revisit its node structure, validity rules and the insertion strategy. The 2DR-tree uses 2D nodes so that the relationships...
182
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
The efficient execution of integration processes between distributed, heterogeneous data sources and applications is a challenging research area of data management. These inn proc...
172
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
We propose a new method to build persistent suffix trees for indexing the genomic data. Our algorithm DiGeST (Disk-Based Genomic Suffix Tree) improves significantly over previous ...
194
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
This article is motivated by the importance of building web data mashups. Building on the remarkable success of Web 2.0 mashups, and specially Yahoo Pipes, we generalize the idea ...