Open AccessProceedings Article
Affinity-based XML Fragmentation
Rebeca Schroeder,Ronaldo dos Santos Mello,Carmem S. Hara +2 more
- 01 Jan 2012
pp 61-66
5
TL;DR: This paper proposes an approach for XML fragmentation that takes as input both the application's expected workload and a storage threshold, and produces as output an XML fragmentation schema that aims to minimize the execution of distributed transactions by packing up related data in a small set of fragments.
read more
Abstract: In this paper we tackle the fragmentation problem for highly distributed databases. In such an environment, a suitable fragmentation strategy may provide scalability and availability by minimizing distributed transactions. We propose an approach for XML fragmentation that takes as input both the application’s expected workload and a storage threshold, and produces as output an XML fragmentation schema. Our workload-aware method aims to minimize the execution of distributed transactions by packing up related data in a small set of fragments. We present experiments that compare alternative fragmentation schemas, showing that the one produced by our technique provides a ner-grained result and better system throughput.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Partitioning Templates for RDF
Rebeca Schroeder,Carmem S. Hara +1 more
- 08 Sep 2015
TL;DR: An RDF data distribution approach which overcomes the shortcomings of the current solutions in order to scale RDF storage both with the volume of data and query requests and is effective to improve the overall performance by decreasing the amount of message passing among servers.
9
A data distribution model for RDF
TL;DR: This paper presents an RDF data distribution method which overcomes the shortcomings of the current approaches in order to scale RDF storage both on the volume of data and query processing and is effective to improve the overall performance by decreasing the amount of message passing among servers.
5
Partitioning RDF exploiting workload information
Rebeca Schroeder,Raqueline R. M. Penteado,Carmem S. Hara +2 more
- 13 May 2013
TL;DR: This paper considers workload data, given in the form of query patterns and their frequencies, for determining how to partition RDF datasets and shows that the workload-aware method is an effective way to cluster related data and provides better query response times compared to an elementary fragmentation method.
Uma abordagem para o particionamento de dados na nuvem baseada em relações de afinidade em grafos
Rebeca Schroeder Freitas
- 01 Jan 2014
TL;DR: A partitioning strategy defined over a summarized view of the dataset given as a database schema, which can be used to partition an existing dataset, as well as maintain the partitioning process when new data that conform to the schema and the workload are inserted to the dataset is provided.
1
Data Value Storage for Compressed Semi-structured Data
Brian G. Tripney,I. Ross,Francis A. Wilson,John N. Wilson +3 more
- 26 Aug 2013
TL;DR: The potential for bisimilarity-based partitioning to be combined with dictionary compression methods to produce a data storage model that remains directly accessible for query processing whilst facilitating the sharing of individual data segments is examined.
References
An evaluation of alternative architectures for transaction processing in the cloud
Donald Kossmann,Tim Kraska,Simon Loesing +2 more
- 06 Jun 2010
TL;DR: The focus of this work is on transaction processing (i.e., read and update workloads), rather than analytics or OLAP workloads, which have recently gained a great deal of attention.
Vertical partitioning for database design: a graphical algorithm
Shamkant B. Navathe,Mingyoung Ra +1 more
- 01 Jun 1989
TL;DR: This paper proposes a new vertical partitioning algorithm which starts from the attribute affinity matrix by considering it as a complete graph and generates all meaningful fragments simultaneously by considering a cycle as a fragment.
XBench - A Family of Benchmarks for XML DBMSs
Benjamin Bin Yao,M. Tamer Özsu,John Keenleyside +2 more
- 01 Jan 2003
TL;DR: The XBench family of benchmarks is summarized, which identifies various classes of XML databases and applications and proposes a set of benchmarks to accommodate these classes.
XML processing in DHT networks
Serge Abiteboul,Ioana Manolescu,Neoklis Polyzotis,Nicoleta Preda,Chong Sun +4 more
- 07 Apr 2008
TL;DR: In this paper, the authors study the scalable management of XML data in P2P networks based on distributed hash tables (DHTs) and propose an array of techniques to lift them.
60
XML processing in DHT networks.
Serge Abiteboul,Ioana Manolescu,Neoklis Polyzotis,Nicoleta Preda,Chong Sun +4 more
- 01 Jan 2007
TL;DR: This work adapts the DHT platform's index store and communication primitives to the needs of massive data processing, and introduces a distributed hierarchical index and associated efficient algorithms to speed up query processing.
59