Sciweavers

2095 search results - page 347 / 419
» Modeling and Querying Semi-structured Data
Sort
View
130
Voted
INFSOF
2006
117views more  INFSOF 2006»
15 years 4 months ago
A high concurrency XPath-based locking protocol for XML databases
Providing efficient access to XML documents becomes crucial in XML database systems. More and more concurrency control protocols for XML database systems were proposed in the past...
Kuen-Fang Jack Jea, Shih-Ying Chen
SIGMOD
2009
ACM
213views Database» more  SIGMOD 2009»
16 years 4 months ago
Dictionary-based order-preserving string compression for main memory column stores
Column-oriented database systems [19, 23] perform better than traditional row-oriented database systems on analytical workloads such as those found in decision support and busines...
Carsten Binnig, Stefan Hildenbrand, Franz Fär...
NAR
2006
170views more  NAR 2006»
15 years 4 months ago
The UCSC Genome Browser Database: update 2006
The University of California Santa Cruz Genome Browser Database (GBD) contains sequence and annotation data for the genomes of about a dozen vertebrate species and several major m...
Angela S. Hinrichs, Donna Karolchik, Robert Baerts...
174
Voted
CIKM
2010
Springer
15 years 2 months ago
Automatic schema merging using mapping constraints among incomplete sources
Schema merging is the process of consolidating multiple schemas into a unified view. The task becomes particularly challenging when the schemas are highly heterogeneous and autono...
Xiang Li 0002, Christoph Quix, David Kensche, Sand...
STOC
2007
ACM
142views Algorithms» more  STOC 2007»
16 years 4 months ago
Lower bounds for randomized read/write stream algorithms
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multi...
Paul Beame, T. S. Jayram, Atri Rudra