Data Mining places specific requirements on DBMS query performance that cannot be evaluated satisfactorily using existing OLAP benchmarks. The DD Benchmark defined here provides a practical case and yardstick to explore how well a DBMS is able to support Data Mining applications. It was derived from real-life data mining tasks performed by our Data SurveyorTM tool running on a variety of DBMS b...

With standardization e orts of a query language for XML documents drawing to a close, researchers and users increasingly focus their attention on the database technology that has to deliver on the new challenges that the sheer amount of XML documents produced by applications pose to data management: validation, performance evaluation and optimization of XML query processors are the upcoming iss...

Real application codes in OpenMP obviously measure the performance of OpenMP programming on the real problems. Although this is ultimately what the end-user wants, the full real applications are often complex and large. In order to obtain a guide to the performance of OpenMP parallel programs in any given parallel systems, kernel and synthetic benchmarks are useful. PARKBENCH[4] is a set of ben...

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 ...

We improve abcdSAT by a new various scoring Scheme. AbcdSAT is a SAT solver built on the top of Glucose 2.3 [5]. The existing Glucose has no inprocess. Nevertheless, here we add various inprocesses to AbcdSAT. According to the rule of different tracks at the SAT Competition 2017, we develop multple versions of abcdSAT, which are submitted to agile, main, no-limit, incremental library and parall...

Image matching has been one of the most fundamental and active research areas in computer vision community. In this field, existing evaluation protocols overemphasize feature design and ignore the performance of image level matching. However, the latter is critical for many high-level vision and robotics tasks. To address this, we present the first application-oriented image matching benchmark ...

Big Data Analytics Benchmark (BigBench). Tags: pdgf Tags: star schema benchmark, ssb, parallel data generation framework, pdgf, benchmarking, skew. relational models which have been for a few years the most used to support classical data warehousing applications such as Star Schema Benchmark (SSB). Star. Schema Benchmark (6) is recently proposed datawarehousing benchmark that has been implement...

K. Allan () Monash University, Melbourne, Australia e-mail: [email protected] Abstract (Im)politeness is never a depersonalized, decontextualized absolute but always a perception or judgement of appropriate behaviour on a given occasion—what one expects oneself and others to do in a particular social interaction. Nevertheless, it is normal for most tabooed words and phrases to be castigat...

We present concepts, design, and use of universal benchmark suites. Such suites consist of benchmark programs that represent all relevant characteristic types of workload. The execution times of individual benchmarks and appropriate weights can be used to compute global performance indicators that reflect a spectrum of specific compound workloads. All such global indicators can be obtained from...