Sciweavers

2539 search results - page 321 / 508
» Updates for Structure Indexes
Sort
View
PODS
2006
ACM
216views Database» more  PODS 2006»
16 years 6 months ago
Cache-oblivious string B-trees
B-trees are the data structure of choice for maintaining searchable data on disk. However, B-trees perform suboptimally ? when keys are long or of variable length, ? when keys are...
Michael A. Bender, Martin Farach-Colton, Bradley C...
EUROSYS
2007
ACM
16 years 3 months ago
STMBench7: a benchmark for software transactional memory
Software transactional memory (STM) is a promising technique for controlling concurrency in modern multi-processor architectures. STM aims to be more scalable than explicit coarse...
Rachid Guerraoui, Michal Kapalka, Jan Vitek
ESWS
2009
Springer
16 years 1 months ago
Benchmarking Fulltext Search Performance of RDF Stores
More and more applications use the RDF framework as their data model and RDF stores to index and retrieve their data. Many of these applications require both structured queries as ...
Enrico Minack, Wolf Siberski, Wolfgang Nejdl
VLDB
2007
ACM
135views Database» more  VLDB 2007»
16 years 19 days ago
Self-Organizing Schema Mappings in the GridVine Peer Data Management System
GridVine is a Peer Data Management System based on a decentralized access structure. Built following the principle of data independence, it separates a logical layer – where dat...
Philippe Cudré-Mauroux, Suchit Agarwal, Adr...
JCDL
2006
ACM
237views Education» more  JCDL 2006»
16 years 14 days ago
Automatic extraction of table metadata from digital documents
Tables are used to present, list, summarize, and structure important data in documents. In scholarly articles, they are often used to present the relationships among data and high...
Ying Liu, Prasenjit Mitra, C. Lee Giles, Kun Bai