A platform for benchmarking Database Management Systems: CyDIW

Relational databases have been popular since a very long time. They store data in a structured way providing optimisation and simplicity. Although the strict structure does not provide flexibility to the developer. It works on having primary key and foreign keys. Joins are created at runtime which eat a lot of memory and time. Graph databases involve nodes and edges. Each node represents an entity and each edge represents a relationship. So when an equivalent JOIN operation is run in graph databases, it saves the time from doing extensive searching. Although graph databases have started gaining a lot of popularity recently, everyone is interested in comparing these popular database management systems. We propose CyDIW (Cyclone Database Implementation Workbench) benchmarking, for measuring performance of MySQL (Relational Database Management System) and Neo4j(Graph Database Management System) in various aspects. CyDIW provides a one-click system to perform an extensive experiment to compare query runtimes. This benchmarking involves a graph model with multiple node types and CRUD operations. We discuss in details the process of creating Neo4j adapter for CyDIW system, which was successfully completed. After extensive study, we see that MySQL is faster than Neo4j for most of the CRUD operations

The benchmarking XQuery and OOXQuery for ease of use and performance

XML – the extensible markup language – is a versatile platform for representation of information. Using the type mechanisms available within XML, we have proposed OOXML, an object-oriented dialect for XML. XML elements can be realized as objects by enhancing them to support object-identities, object hierarchy, and references. As OOXML documents are legal XML documents, they are amenable for use in XML processing technologies such as XQuery, XSLT, DOM/API, etc. In addition to the usual syntax the users can benefit from dotted expressions of object-oriented systems to access properties of super and referenced objects, we have implemented a preprocessor for OOXQuery – a dialect of XQuery – that translates an OOXQuery query into XQuery query. Although the translated query is cryptic for users, it can be processed in an XQuery engine. In this paper we consider benchmarking XQuery and OOXQuery for ease of use and runtime performance. Due to dotted expressions, OOXQuery is generally more natural than XQuery. For many types of queries, the performance of OOXQuery seems better. Therefore, we find that OOXQuery is an interesting alternative to XQuery. The object hierarchy is available in two flavors: hierarchy by reference and hierarchy by value for which we informally use suffixes “-R” and “-V”, respectively, when necessary. Within the two options for hierarchy, OOXQuery-R seems more natural than OOXQuery-V and the performance results are mixed