There is, I think, something ethereal about i —the square root of minus one. I remember first hearing about it at school. It seemed an odd beast at that time—an intruder hovering on the edge of reality.

Usually familiarity dulls this sense of the bizarre, but in the case of i it was the reverse: over the years the sense of its surreal nature intensified. It seemed that it was impossible to write mathematics that described the real world in …

I and i

While the use of MapReduce systems (such as Hadoop) for large scale data analysis has been widely recognized and studied, we have recently seen an explosion in the number of systems developed for cloud data serving. These newer systems address "cloud OLTP" applications, though they typically do not support ACID transactions. Examples of systems proposed for cloud serving use include BigTable, PNUTS, Cassandra, HBase, Azure, CouchDB, SimpleDB, Voldemort, and many others. Further, they are being applied to a diverse range of applications that differ considerably from traditional (e.g., TPC-C like) serving workloads. The number of emerging cloud serving systems and the wide range of proposed applications, coupled with a lack of apples-to-apples performance comparisons, makes it difficult to understand the tradeoffs between systems and the workloads for which they are suited. We present the "Yahoo! Cloud Serving Benchmark" (YCSB) framework, with the goal of facilitating performance comparisons of the new generation of cloud data serving systems. We define a core set of benchmarks and report results for four widely used systems: Cassandra, HBase, Yahoo!'s PNUTS, and a simple sharded MySQL implementation. We also hope to foster the development of additional cloud benchmark suites that represent other classes of applications by making our benchmark tool available via open source. In this regard, a key feature of the YCSB framework/tool is that it is extensible--it supports easy definition of new workloads, in addition to making it easy to benchmark new systems.

/pdf/benchmarking-cloud-serving-systems-with-ycsb-3u47swhmki.pdf

Benchmarking cloud serving systems with YCSB

Data integration is the problem of combining data residing at different sources, and providing the user with a unified view of these data. The problem of designing data integration systems is important in current real world applications, and is characterized by a number of issues that are interesting from a theoretical point of view. This document presents on overview of the material to be presented in a tutorial on data integration. The tutorial is focused on some of the theoretical issues that are relevant for data integration. Special attention will be devoted to the following aspects: modeling a data integration application, processing queries in data integration, dealing with inconsistent data sources, and reasoning on queries.

/pdf/data-integration-a-theoretical-perspective-58aesjvhuk.pdf

Data integration: a theoretical perspective

https://people.mpi-inf.mpg.de/~kberberi/publications/2010-mpii-tra.pdf

YAGO2: A spatially and temporally enhanced knowledge base from Wikipedia

This article reviews the state-of-the-art in overlapping community detection algorithms, quality measures, and benchmarks. A thorough comparison of different algorithms (a total of fourteen) is provided. In addition to community-level evaluation, we propose a framework for evaluating algorithms' ability to detect overlapping nodes, which helps to assess overdetection and underdetection. After considering community-level detection performance measured by normalized mutual information, the Omega index, and node-level detection performance measured by F-score, we reached the following conclusions. For low overlapping density networks, SLPA, OSLOM, Game, and COPRA offer better performance than the other tested algorithms. For networks with high overlapping density and high overlapping diversity, both SLPA and Game provide relatively stable performance. However, test results also suggest that the detection in such networks is still not yet fully resolved. A common feature observed by various algorithms in real-world networks is the relatively small fraction of overlapping nodes (typically less than 30p), each of which belongs to only 2 or 3 communities.

Overlapping community detection in networks: The state-of-the-art and comparative study

While standardization efforts for XML query languages have been progressing, researchers and users increasingly focus on the database technology that has to deliver on the new challenges that the abundance of XML documents poses to data management: validation, performance evaluation and optimization of XML query processors are the upcoming issues. Following a long tradition in database research, we provide a framework to assess the abilities of an XML database to cope with a broad range of different query types typically encountered in real-world scenarios. The benchmark can help both implementors and users to compare XML databases in a standardized application scenario. To this end, we offer a set of queries where each query is intended to challenge a particular aspect of the query processor. The overall workload we propose consists of a scalable document database and a concise, yet comprehensive set of queries which covers the major aspects of XML query processing ranging from textual features to data analysis queries and ad hoc queries. We complement our research with results we obtained from running the benchmark on several XML database platforms. These results are intended to give a first baseline and illustrate the state of the art.

/pdf/xmark-a-benchmark-for-xml-data-management-1poftzlfoc.pdf

XMark: a benchmark for XML data management

¢¡W£¥¤§¦7 ̈5©a¬«W­m¤w®m©B£¥ ̄°­m¤2±c3&±c©®t¡W£ ́B­m®m ́BμW©­ ¶p ̈5©y£¥3H ́w­m·5©B±g ́w£¥3W· ¡W­e ́B­© ̈5·5­m3W­m ̈5μW¤¬«±g ́w± ¤w ̈5μW©®m­¤μW3W«W­m©J±c3 ̧>1§o·5»¥ ̈5 ̄±c» ¤w®w¡W­m1⁄4"±_1⁄23⁄4¶p ̈5»¥»¥ ̈¿¦P£¥3W· ́B¡W­JÀ ÁÂtÃ5À ÄÅÃ5ÆtÄÇ¿ÈÉÊË±cÌWÌW© ̈H±c®t¡Íp»¥ ̈E®±c» ¤w ̈5μ_©B®m­m¤¿Îg¤w®t¡W­m1⁄4"±c¤±c©­@«W­m¤w®m©£¥ ̄°­«k±c¤iÏ_£¥­e¦P¤i ̈¿ÏH­m©i ́w¡_­@·5»¥ ̈5 ̄±c» ¤w®w¡W­m1⁄4"±HÐeÑPÒ3§ ́B¡W£¥¤Q®m ̈53H ́w­eÓY ́¿1⁄2 ¦7­:¶ ̈Y®mμW¤Q ̈53§ ́B¡W­3⁄4ÌW©B ̈5 ̄_»¥­1⁄4 ̈c¶ ́B©w±c3W¤B»a±g ́w£¥3_· ́B¡W­,μW¤w­m©mÎ ¤kÔYμW­m©Õ%±c·H±c£¥3W¤B ́{ ́w¡W­" ̧Q1§or·5»¥ ̈5 ̄±c» ¤w®w¡W­m1⁄4"±{£¥3H ́w ̈}± ÖW×Qo2ÔYμW­m©Õ ̈¿ÏH­m©¢ ́w¡_­:»¥ ̈E®±c»Z«±g ́w± ¤w ̈5μ_©B®m­m¤¿Ñ

Answering XML Queries on Heterogeneous Data Sources

With standardization efforts 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 issues. Following a long tradition in database research, the XML Store Benchmark Project provides a framework to assess an XML database''s abilities to cope with a broad spectrum of different queries, typically posed in real-world application scenarios. The benchmark is intended to help both implementors and users to compare XML databases independent of their own, specific application scenario. To this end, the benchmark offers a set queries each of which is intended to challenge a particular primitive of the query processor or storage engine. The overall workload we propose consists of a scalable document database and a concise, yet comprehensive set of queries, which covers the major aspects of query processing. The queries'' challenges range from stressing the textual character of the document to data analysis queries, but include also typical ad-hoc queries. We complement our research with results obtained from running the benchmark on our XML database platform. They are intended to give a first baseline, illustrating the state of the art.

/pdf/the-xml-benchmark-project-52ii59s4jo.pdf

The XML benchmark project

It is our great pleasure to welcome you to the 17th ACM Conference on Information and Knowledge Management -- CIKM'08. Since 1992, the ACM Conference on Information and Knowledge Management (CIKM) has been successfully bringing together leading researchers and developers from the database, information retrieval, and knowledge management communities. The purpose of the conference is to identify challenging problems facing the development of future knowledge and information systems, and to shape future research directions through the publication of high quality, applied and theoretical research findings. In CIKM 2008, we continued the tradition of promoting collaboration among the general areas of databases, information retrieval, and knowledge management. This year's call for papers attracted almost 800 submissions from Asia, Canada, Europe, Africa, and the United States. The program committee accepted 132 papers and 103 posters giving CIKM'08 an acceptance rate of 17%.

Proceedings of the 17th ACM conference on Information and knowledge management

Due to the popularity of the XML data format, several query languages for XML have been proposed, specially devised to handle data of which the structure is unknown, loose, or absent. While these languages are rich enough to allow for querying the content and structure of an XML document, a varying or unknown structure can make formulating queries a very difficult task. We propose an extension to XML query languages that enables keyword search at the granularity of XML elements, that helps novice users formulate queries, and also yields new optimization opportunities for the query processor. We present an implementation of this extension on top of a commercial RDBMS; we then discuss implementation choices and performance results.

Ioana Manolescu

Papers

XMark: a benchmark for XML data management

Answering XML Queries on Heterogeneous Data Sources

The XML benchmark project

Proceedings of the 17th ACM conference on Information and knowledge management

Integrating keyword search into XML query processing