Temporal Support for Persistent Stored Modules

Snodgrass, Richard T.; Gao, Dengfeng; Zhang, Rui; Thomas, Stephen W.

doi:10.1109/icde.2012.70

Cited by 7 publications

(6 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Data translators are used to easily change data from one format to another, for example, by shredding an XML document into relations . Schema/workload translators such as TXL can be used to translate the schema and workload from one form to another, for example, to translate τ XQuery queries into standard XQuery queries .…”

Section: Benchmarks and Benchmark Familiesmentioning

confidence: 99%

“…τ Bench currently consists of ten individual benchmarks, spanning various technologies including XML, XML Schema , XQuery , τ XSchema , τ XQuery , PSM , and τ PSM ; the B‐R diagram is given in Figure , and the main components are summarized in Table . The benchmarks are fully described elsewhere ; we briefly describe the components of each here.…”

Section: Case Study: τBenchmentioning

confidence: 99%

“…Temporal SQL/PSM is a temporal extension to SQL/PSM that supports temporal relations and queries in conjunction with PSM functionality . The approach is similar to τ XQuery in that it requires minor new syntax beyond that already in SQL/Temporal to define temporal PSM routines.…”

Section: Case Study: τBenchmentioning

confidence: 99%

“…The τ PSM benchmark was created to test and validate Temporal SQL/PSM. There have been two different time‐slicing techniques proposed for implementing Temporal SQL/PSM: maximally fragmented slicing and per‐statement slicing . These slicing techniques are each a source‐to‐source translation of the sequenced queries and PSM routines of the workloads into conventional queries and PSM routines that explicitly manage the timestamps in the data, to optimize the temporal queries in various ways.…”

Section: Case Study: τBenchmentioning

confidence: 99%

“…The workload for four τ PSM‐Mapped variants is the result of an automated transformation, using the previously mentioned maximally fragmented and per‐statement slicing techniques , expressed in TXL, to create 170 queries in total.…”

Section: Case Study: τBenchmentioning

confidence: 99%

See 4 more Smart Citations

Benchmark frameworks andτBench

Thomas

Snodgrass

Zhang

2013

Softw. Pract. Exper.

Self Cite

View full text Add to dashboard Cite

Software engineering frameworks tame the complexity of large collections of classes by identifying structural invariants, regularizing interfaces, and increasing sharing across the collection. We wish to appropriate these benefits for families of closely related benchmarks, say for evaluating query engine implementation strategies. We introduce the notion of a benchmark framework, an ecosystem of benchmarks that are related in semantically rich ways and enabled by organizing principles. A benchmark framework is realized by iteratively changing one individual benchmark into another, say by modifying the data format, adding schema constraints, or instantiating a different workload. Paramount to our notion of benchmark frameworks are the ease of describing the differences between individual benchmarks and the utility of methods to validate the correctness of each benchmark component by exploiting the overarching ecosystem. As a detailed case study, we introduce Bench, a benchmark framework consisting of ten individual benchmarks, spanning XML, XQuery, XML Schema, and PSM, along with temporal extensions to each. The second case study examines the Mining Unstructured Data benchmark framework, and the third examines the potential benefits of rendering the TPC family as a benchmark framework.

show abstract

Section: Benchmarks and Benchmark Familiesmentioning

confidence: 99%