DOCSLIB.ORG

A Blockchain-Based Storage System for Data Analytics in the Internet of Things

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

A Blockchain-Based Storage System for Data Analytics in the Internet of Things Quanqing Xu, Khin Mi Mi Aung, Yongqing Zhu and Khai Leong Yong Abstract Without a central authority, blockchains can easily enable the management of transactions. Smart contracts stored on blockchains are self-executing contractual states that are not controlled by anybody, so they can be trusted. In addition, due to increasing improvements in processor and memory technology, IoT (Internet of Things) devices have more powerful processing power and greater mem- ory space, which allow them to execute user-defined programs, e.g., smart contracts. Shifting part of applications’ tasks to IoT devices reduces the transferred data amount over the IoT network. The parallelism of large-scale storage systems is employed to decrease many basic data analytics tasks’ execution time. Blockchain can be used as smart contracts that facilitate and enforce the negotiation of a contract in the IoT. This chapter proposes a blockchain-based storage system, named Sapphire, for data ana- lytics applications in the Internet of Things. All the IoT data from the devices forms objects with IDs, attributes, policies, and methods. We present an OSD-based smart contract (OSC) approach employed in Sapphire as a transaction protocol, where IoT devices interact with such blockchains. For data analytics applications, the IoT device processors execute application-specific operations. By doing so, only the results are returned to clients instead of datafiles read by them. Therefore, the Sapphire system can greatly decrease the overhead of data analytics in the Internet of Things. Keywords Internet of things ⋅ Blockchain ⋅ Storage system ⋅ Data analytics ⋅ Smart contract Q. Xu (✉)⋅ K.M.M. Aung⋅ Y. Zhu⋅ K.L. Yong Data Storage Institute, A*STAR, Singapore, Singapore e-mail: [email protected] K.M.M. Aung e-mail: [email protected] Y. Zhu e-mail: [email protected] K.L. Yong e-mail: [email protected] © Springer International Publishing AG 2018 119 R.R. Yager and J. Pascual Espada (eds.), New Advances in the Internet of Things, Studies in Computational Intelligence 715, DOI 10.1007/978-3-319-58190-3_8 120 Q. Xu et al. 1 Introduction The IoT (Internet of Things) is a network that is able to connect many objects to the Internet via a large number of devices, e.g., sensors, cameras, smart phones, and RFID (Radio-frequency identification) readers. All common physical objects in the IoT have an IP address or URI, and they can exchange information among them. It finally reaches a goal of intelligent management and recognition. The IoT devices (or things) are seamlessly linked into a virtual world via the IoT network, enabling anywhere and anytime connectivity. There would be 50 billion devices by 2020 as there are increasingly smart devices per person [1]. There would be 100 billion IoT connections, and thefinancial impact of IoT may be as much as $3.9 to $11.1 trillion on the global economy by 2025 [2]. Data in the IoT environment is from a large number of different devices. It represents billions of objects, thus it would be so extremely large that we must build a scalable distributed storage system. IoT has received extensive attentions from both academia and industry recently, and its basic idea is to integrate the things into the Internet with provision of vari- ous services to users [3]. There are typical killer applications of IoT, such as smart home [4, 5], smart grid [6], and smart building [7]. As we see that there are increasing IoT devices, it is possible to use blockchain technologies [8] that manages numer- ous unspecified devices and processes, including communications and transactions among the devices. Without a central authority, blockchain technologies guarantee the security and credibility of data. Transactions among IoT devices are recorded on blockchains as smart contracts [9] and executed automatically to improve transac- tion efficiency greatly. For example, transactions and settlements are completed auto- matically irrespective of past relationships with other relevant IoT devices. Without central third parties, mutually distrustful IoT devices are allowed to transact safely in emerging smart contract systems. The decentralized blockchain [10] makes sure that IoT devices obtain commensurate compensation regardless of contractual breaches or aborts. For example, Ethereum Virtual Machine allows executing code in the form of so-called smart contracts on Ethereum [11], which is a Turing-complete decen- tralized smart contract system. Many companies or organizations have been building smart contract applications over Ethereum. The rapid growth of data-driven applications shifts the nature of distributed stor- age systems. In object-based storage (or object storage) [12] systems, each object has a unique OID allowing a server/client to obtain it without its physical location, and all objects reside in aflat address space. An object-based storage device (OSD) manages lower-level space functions after allocating space for objects. Upper appli- cations and users connect with many objects through APIs. Increasingly, we design a distributed storage system mainly for capacity instead of performance. Distribu- tion and tiering are vital, and analytics applications are both essential and routine across any heat of data and any dimension. The applications primarily depend on semi-structured or unstructured data that is inexpensive and easy to create. As a consequence, the value of data management and analytics fuel the growth for data preservation in storage systems. In order to achieve the explosive storage growth, we A Blockchain-Based Storage System for Data Analytics ... 121 need to remove layers of inefficiency from traditional storage system architectures and present a new method optimized for scale-out application requirements. This chapter presents a blockchain-based distributed storage system, called Sap- phire, as an evolution of Gem[ 13, 14], for large-scale data analytics applications in the IoT. This system is able to support diverse data-intensive applications. In this chapter, we depict the blockchain-based large-scale storage system, which is fol- lowed to put forward data analytics based on the storage system. We present an OSD- based smart contract (OSC) as a transaction protocol, in which IoT devices inter- act with such blockchains in Sapphire. We develop blockchain-based storage and processing techniques, in which object storage devices employ embedded processors in the devices to process apart from storing data. Direct data process in the drives can lead to a dramatic performance growth, by avoiding redundant data transfers across storage buses and networks. The rest of this chapter is organized as follows. We introduce background and motivation in Sect. 2. We describe the system architecture of Sapphire in Sect. 3. We propose a location- and type-sensitive hashing mechanism, and a dynamic load balancing method in Sect. 4. In Sect. 5, we present an OSD-based smart contract (OSC) mechanism. In Sect. 6 IoT data analytics is presented. We summarize this chapter in Sect. 7. 2 Background and Motivation In some applications, e.g., IoT storage, social network services, and cloud stor- age, object storage performs better than SAN (Storage Area Network) and NAS (Network-Attached Storage) [15] for large-scale semi-structured or unstructured data sets. 2.1 Object Storage Object storage can easily support the explosive growth of data since we can scale- out OSDs geographically. Distributing data replicas can enhance data protection across multiple storage nodes. Object storage is an attractive solution to efficiently manage large-scale semi-structured or unstructured data sets from the Internet of Things. An object, as shown in Fig. 1a, consists of its ID, data, and attributes, which include metadata, policies (e.g., replication), methods (e.g., encryption/decryption), and user-/application-defined functions. As shown in Fig. 1b, each object has unique ID and pathname in object mapping. Object storage is able to be utilized for archiv- ing the IoT data, e.g., sensor, camera, and smart phone data, with high compliance. Object storage systems offer the benefit of releasing storage space by enabling users to correctly differentiate data. 122 Q. Xu et al. Fig. 1 Object-based storage 2.2 Requirements of IoT The Internet of Things enables the most efficient and effective stack including sys- tems, interfaces, protocols, and devices, to do optimizations for distributed applica- tions. In addition, it enables object-oriented distributed applications to directly utilize storage and fuels scale-out distributed systems. In such a way, it also enables signifi- cant gains in performance and TCO (Total Cost of Ownership). The IoT data comes from a large number of different devices generating billions of data objects, and is sampled by various of perception devices, e.g., cameras, smart phones, sensors, and RFID (Radio-frequency identification) readers. However, the IoT data from differ- ent devices has distinct structures and semantics. The IoT network consists of a large number of perception devices that automatically and continuously collect informa- tion, resulting in the explosive growth of data scale. In addition, the IoT applications usually integrate a large number of sensors to simultaneously monitor many indi- cators, such as humidity, light, pressure, and temperature, so the sampled data is usually multidimensional. Different from traditional Internet data, the IoT data has two attributes: time and space inherently to depict dynamic state changes of object locations. Most of IoT applications are isolated, but the IoT network has tofinally realize data sharing to facilitate collaborations among different IoT applications. 2.3 Smart Contract Blockchain technology has been widely utilized by companies or organizations as a means to reorganize their centralized networks due to its decentralized nature. A blockchain, as an append-only distributed database, stores transactions that are a time-ordered set of records. Transactions are grouped into blocks and form a cryp- tographic hash chain in a decentralized network.
Recommended publications
  • SAQE: Practical Privacy-Preserving Approximate Query Processing for Data Federations

    SAQE: Practical Privacy-Preserving Approximate Query Processing for Data Federations

    SAQE: Practical Privacy-Preserving Approximate Query Processing for Data Federations Johes Bater Yongjoo Park Xi He Northwestern University University of Illinois (UIUC) University of Waterloo [email protected] [email protected] [email protected] Xiao Wang Jennie Rogers Northwestern University Northwestern University [email protected] [email protected] ABSTRACT 1. INTRODUCTION A private data federation enables clients to query the union of data Querying the union of multiple private data stores is challeng- from multiple data providers without revealing any extra private ing due to the need to compute over the combined datasets without information to the client or any other data providers. Unfortu- data providers disclosing their secret query inputs to anyone. Here, nately, this strong end-to-end privacy guarantee requires crypto- a client issues a query against the union of these private records graphic protocols that incur a significant performance overhead as and he or she receives the output of their query over this shared high as 1,000× compared to executing the same query in the clear. data. Presently, systems of this kind use a trusted third party to se- As a result, private data federations are impractical for common curely query the union of multiple private datastores. For example, database workloads. This gap reveals the following key challenge some large hospitals in the Chicago area offer services for a cer- in a private data federation: offering significantly fast and accurate tain percentage of the residents; if we can query the union of these query answers without compromising strong end-to-end privacy. databases, it may serve as invaluable resources for accurate diag- To address this challenge, we propose SAQE, the Secure Ap- nosis, informed immunization, timely epidemic control, and so on.
  • Veritas: Shared Verifiable Databases and Tables in the Cloud

    Veritas: Shared Verifiable Databases and Tables in the Cloud

    Veritas: Shared Verifiable Databases and Tables in the Cloud Lindsey Alleny, Panagiotis Antonopoulosy, Arvind Arasuy, Johannes Gehrkey, Joachim Hammery, James Huntery, Raghav Kaushiky, Donald Kossmanny, Jonathan Leey, Ravi Ramamurthyy, Srinath Settyy, Jakub Szymaszeky, Alexander van Renenz, Ramarathnam Venkatesany yMicrosoft Corporation zTechnische Universität München ABSTRACT A recent class of new technology under the umbrella term In this paper we introduce shared, verifiable database tables, a new "blockchain" [11, 13, 22, 28, 33] promises to solve this conundrum. abstraction for trusted data sharing in the cloud. For example, companies A and B could write the state of these shared tables into a blockchain infrastructure (such as Ethereum [33]). The KEYWORDS blockchain then gives them transaction properties, such as atomic- ity of updates, durability, and isolation, and the blockchain allows Blockchain, data management a third party to go through its history and verify the transactions. Both companies A and B would have to write their updates into 1 INTRODUCTION the blockchain, wait until they are committed, and also read any Our economy depends on interactions – buyers and sellers, suppli- state changes from the blockchain as a means of sharing data across ers and manufacturers, professors and students, etc. Consider the A and B. To implement permissioning, A and B can use a permis- scenario where there are two companies A and B, where B supplies sioned blockchain variant that allows transactions only from a set widgets to A. A and B are exchanging data about the latest price for of well-defined participants; e.g., Ethereum [33]. widgets and dates of when widgets were shipped.
  • SQL Database Management Portal

    SQL Database Management Portal

    APPENDIX A SQL Database Management Portal This appendix introduces you to the online SQL Database Management Portal built by Microsoft. It is a web-based application that allows you to design, manage, and monitor your SQL Database instances. Although the current version of the portal does not support all the functions of SQL Server Management Studio, the portal offers some interesting capabilities unique to SQL Database. Launching the Management Portal You can launch the SQL Database Management Portal (SDMP) from the Windows Azure Management Portal. Open a browser and navigate to https://manage.windowsazure.com, and then login with your Live ID. Once logged in, click SQL Databases on the left and click on your database from the list of available databases. This brings up the database dashboard, as seen in Figure A-1. To launch the management portal, click the Manage icon at the bottom. Figure A-1. SQL Database dashboard in Windows Azure Management Portal 257 APPENDIX A N SQL DATABASE MANAGEMENT PORTAL N Note You can also access the SDMP directly from a browser by typing https://sqldatabasename.database. windows.net, where sqldatabasename is the server name of your SQL Database. A new web page opens up that prompts you to log in to your SQL Database server. If you clicked through the Windows Azure Management Portal, the database name will be automatically filled and read-only. If you typed the URL directly in a browser, you will need to enter the database name manually. Enter a user name and password; then click Log on (Figure A-2).
  • Plan Stitch: Harnessing the Best of Many Plans

    Plan Stitch: Harnessing the Best of Many Plans

    Plan Stitch: Harnessing the Best of Many Plans Bailu Ding Sudipto Das Wentao Wu Surajit Chaudhuri Vivek Narasayya Microsoft Research Redmond, WA 98052, USA fbadin, sudiptod, wentwu, surajitc, [email protected] ABSTRACT optimizer chooses multiple query plans for the same query, espe- Query performance regression due to the query optimizer select- cially for stored procedures and query templates. ing a bad query execution plan is a major pain point in produc- The query optimizer often makes good use of the newly-created indexes and statistics, and the resulting new query plan improves tion workloads. Commercial DBMSs today can automatically de- 1 tect and correct such query plan regressions by storing previously- in execution cost. At times, however, the latest query plan chosen executed plans and reverting to a previous plan which is still valid by the optimizer has significantly higher execution cost compared and has the least execution cost. Such reversion-based plan cor- to previously-executed plans, i.e., a plan regresses [5, 6, 31]. rection has relatively low risk of plan regression since the deci- The problem of plan regression is painful for production applica- sion is based on observed execution costs. However, this approach tions as it is hard to debug. It becomes even more challenging when ignores potentially valuable information of efficient subplans col- plans change regularly on a large scale, such as in a cloud database lected from other previously-executed plans. In this paper, we service with automatic index tuning. Given such a large-scale pro- propose a novel technique, Plan Stitch, that automatically and op- duction environment, detecting and correcting plan regressions in portunistically combines efficient subplans of previously-executed an automated manner becomes crucial.
  • Exploring Query Re-Optimization in a Modern Database System

    Exploring Query Re-Optimization in a Modern Database System

    Radboud University Nijmegen Institute of Computing and Information Sciences Exploring Query Re-Optimization In a Modern Database System Master Thesis Computing Science Supervisor: Prof. dr. ir. Arjen P. Author: de Vries BSc Laurens N. Kuiper Second reader: Prof. dr. ir. Djoerd Hiemstra May 2021 Abstract The standard approach to query processing in database systems is to optimize before executing. When available statistics are accurate, optimization yields the optimal plan, and execution is as quick as it can be. However, when queries become more complex, the quality of statistics degrades, which leads to sub-optimal query plans, sometimes up to several orders of magnitude worse. Improving statistics for these queries is infeasible because the cardinality estimation error propagates exponentially through the plan. This problem can be alleviated through re-optimization, which is to progressively optimize the query, executing parts of the plan at a time, improving plan quality at the cost of additional overhead. In this work, re-optimization is implemented and simulated in DuckDB, a main-memory database system designed for analytical workloads, and evaluated on the Join Order Benchmark. Total plan cost of the benchmark is reduced by up to 44% using this method, and a reduction in end-to-end query latency of up to 20% is observed using only simple re-optimization schemes, showing the potential of this approach. Acknowledgements The past year has been a challenging and exciting year. From breaking my leg to starting a job, and finally finishing my thesis. I would like to thank everyone who supported me during this period, and helped me get here.
  • Queryguard: Privacy-Preserving Latency-Aware Query Optimization for Edge Computing

    Queryguard: Privacy-Preserving Latency-Aware Query Optimization for Edge Computing

    QueryGuard: Privacy-preserving Latency-aware Query Optimization for Edge Computing Runhua Xu ∗, Balaji Palanisamy y and James Joshi z School of Computing and Information University of Pittsburgh, Pittsburgh, PA USA ∗[email protected], [email protected], [email protected] Abstract—The emerging edge computing paradigm has en- adopting distributed database techniques in edge computing abled applications having low response time requirements to brings new challenges and concerns. First, in contrast to meet the quality of service needs of applications by moving the cloud data centers where cloud servers are managed through computations to the edge of the network that is geographically closer to the end-users and end-devices. Despite the low latency strict and regularized policies, edge nodes may not have the advantages provided by the edge computing model, there are same degree of regulatory and monitoring oversight. This significant privacy risks associated with the adoption of edge may lead to higher privacy risks compared to that in cloud computing services for applications dealing with sensitive data. servers. In particular, when dealing with a join query, tra- In contrast to cloud data centers where system infrastructures are ditional distributed query processing techniques sometimes managed through strict and regularized policies, edge computing nodes are scattered geographically and may not have the same ship selected or projected data to different nodes, some of degree of regulatory and monitoring oversight. This can lead which may be untrusted or semi-trusted. Thus, such techniques to higher privacy risks for the data processed and stored at may lead to greater disclosure of private information within the edge nodes, thus making them less trusted.
  • Lesson 4: Optimize a Query Using the Sybase IQ Query Plan

    Lesson 4: Optimize a Query Using the Sybase IQ Query Plan

    Author: Courtney Claussen – SAP Sybase IQ Technical Evangelist Contributor: Bruce McManus – Director of Customer Support at Sybase Getting Started with SAP Sybase IQ Column Store Analytics Server Lesson 4: Optimize a Query using the SAP Sybase IQ Query Plan Copyright (C) 2012 Sybase, Inc. All rights reserved. Unpublished rights reserved under U.S. copyright laws. Sybase and the Sybase logo are trademarks of Sybase, Inc. or its subsidiaries. SAP and the SAP logo are trademarks or registered trademarks of SAP AG in Germany and in several other countries all over the world. All other trademarks are the property of their respective owners. (R) indicates registration in the United States. Specifications are subject to change without notice. Table of Contents 1. Introduction ................................................................................................................1 2. SAP Sybase IQ Query Processing ............................................................................2 3. SAP Sybase IQ Query Plans .....................................................................................4 4. What a Query Plan Looks Like ................................................................................5 5. What a Query Plan Will Tell You ............................................................................7 5.1 Query Tree Nodes and Node Detail ......................................................................7 5.1.1 Root Node Details ..........................................................................................7
  • Query Processing for SQL Updates

    Query Processing for SQL Updates

    Query Processing for SQL Updates Cesar´ A. Galindo-Legaria Stefano Stefani Florian Waas [email protected] [email protected] fl[email protected] Microsoft Corp., One Microsoft Way, Redmond, WA 98052 ABSTRACT tradeoffs between plans that do serial or random I/Os. This moti- A rich set of concepts and techniques has been developed in the vates the integration of update processing in the general framework context of query processing for the efficient and robust execution of query processing. To be successful, this integration needs to of queries. So far, this work has mostly focused on issues related model update processing in a suitable way and consider the special to data-retrieval queries, with a strong backing on relational alge- requirements of updates. One of the few papers in this area is [2], bra. However, update operations can also exhibit a number of query which deals with delete operations, but there is little documented processing issues, depending on the complexity of the operations on the integration of updates with query processing, to the best of and the volume of data to process. Such issues include lookup and our knowledge. matching of values, navigational vs. set-oriented algorithms and In this paper, we present an overview of the basic concepts used trade-offs between plans that do serial or random I/Os. to support SQL Data Manipulation Language (DML) by the query In this paper we present an overview of the basic techniques used processor in Microsoft SQL Server. We focus on the query process- to support SQL DML (Data Manipulation Language) in Microsoft ing aspects of the problem, how data is modeled, primitive opera- SQL Server.
  • CPS216: Advanced Database Systems Notes 03:Query Processing

    CPS216: Advanced Database Systems Notes 03:Query Processing

    CPS216: Advanced Database Systems Notes 03:Query Processing (Overview, contd.) Shivnath Babu Overview of SQL query Query parse Processing parse tree Query rewriting Query statistics logical query plan Optimization Physical plan generation physical query plan execute Query Execution result SQL query Initial logical plan parse parse tree Rewrite rules Query rewriting Logical plan statistics logical query plan Physical plan generation “Best” logical plan physical query plan execute result Query Rewriting π π B,D B,D σ σ R.C = S.C R.A = “c” Λ R.C = S.C σ R.A = “c” X X RS RS We will revisit it towards the end of this lecture SQL query parse parse tree Query rewriting statistics Best logical query plan Physical plan generation Best physical query plan execute result Physical Plan Generation π B,D Project Natural join Hash join σ R.A = “c” S Index scan Table scan R RS Best logical plan SQL query parse parse tree Enumerate possible physical plans Query rewriting statistics Best logical query plan Find the cost of each plan Physical plan generation Best physical query plan Pick plan with execute minimum cost result Physical Plan Generation Logical Query Plan Physical P1 P2 …. Pn plans C1 C2 …. Cn Costs Pick minimum cost one Plans for Query Execution • Roadmap – Path of a SQL query – Operator trees – Physical Vs Logical plans – Plumbing: Materialization Vs pipelining Modern DBMS Architecture Applications SQL DBMS Parser Logical query plan Query Optimizer Physical query plan Query Executor Access method API calls Storage Manager Storage system API calls File system API calls OS Disk(s) Logical Plans Vs.
  • Protecting User Privacy Using Declarative Preferences During Distributed Query Processing

    Protecting User Privacy Using Declarative Preferences During Distributed Query Processing

    Don’t Reveal My Intension: Protecting User Privacy Using Declarative Preferences during Distributed Query Processing Nicholas L. Farnan1,AdamJ.Lee1, Panos K. Chrysanthis1, and Ting Yu2 1 Department of Computer Science, University of Pittsburgh 2 Department of Computer Science, North Carolina State University Abstract. In a centralized setting, the declarative nature of SQL is a major strength: a user can simply describe what she wants to retrieve, and need not worry about how the resulting query plan is actually gener- ated and executed. However, in a decentralized setting, two query plans that produce the same result might actually reveal vastly different infor- mation about the intensional description of a user’s query to the servers participating its evaluation. In cases where a user considers portions of her query to be sensitive, this is clearly problematic. In this paper, we address the specification and enforcement of querier privacy constraints on the execution of distributed database queries. We formalize a notion of intensional query privacy called (I,A)-privacy, and extend the syn- tax of SQL to allow users to enforce strict (I,A)-privacy constraints or partially ordered privacy/performance preferences over the execution of their queries. 1 Introduction Applications are increasingly becoming more decentralized, relying on data ex- change between autonomous and distributed data stores. This reliance is in some cases a design decision motivated by the need for scalability; for example, when user demand for a service exceeds what a system at a single site would be able to provide and replication becomes a necessity. In other instances, it is a fact of life that must be dealt with.
  • Anylog: a Grand Unification of the Internet of Things

    Anylog: a Grand Unification of the Internet of Things

    AnyLog: a Grand Unification of the Internet of Things Daniel Abadi Owen Arden University of Maryland University of California, [email protected] Santa Cruz [email protected] Faisal Nawab Moshe Shadmon University of California, AnyLog Santa Cruz [email protected] [email protected] ABSTRACT specify the permissions of that data. Some data will be published AnyLog is a decentralized platform for data publishing, sharing, with open access—in which case it will be queryable by any user of and querying IoT (Internet of Things) data that enables an unlim- AnyLog. Other data will be published in encrypted form, in which ited number of independent participants to publish and access the case only users with access to the decryption key may access it. contents of IoT datasets stored across the participants. AnyLog AnyLog is designed to provide a powerful query interface to the provides decentralized publishing and querying functionality over entire wealth of data produced by IoT devices. Questions such as: structured data in an analogous fashion to how the world wide “What was the maximum temperature reported in Palo Alto on June web (WWW) enables decentralized publishing and accessing of 21, 2008?” or “What was the difference in near accidents between unstructured data. However, AnyLog differs from the traditional self-driving cars that used deep-learning model X vs. self-driving WWW in the way that it provides incentives and financial reward cars that used deep-learning model Y?” or “How many cars passed for performing tasks that are critical to the well-being of the system the toll bridge in the last hour?” or “How many malfunctions were as a whole, including contribution, integration, storing, and pro- reported by a turbine of a particular model in all deployments in cessing of data, as well as protecting the confidentiality, integrity, the last year?” can all be expressed using clean and clearly spec- and availability of that data.
  • HP Nonstop SQL/MX Release 3.1 Query Guide

    HP Nonstop SQL/MX Release 3.1 Query Guide

    TP663851.fm Page 1 Monday, October 17, 2011 11:48 AM HP NonStop SQL/MX Release 3.1 Query Guide Abstract This guide describes how to understand query execution plans and write optimal queries for an HP NonStop™ SQL/MX database. It is intended for database administrators and application developers who use NonStop SQL/MX to query an SQL/MX database and who have a particular interest in issues related to query performance. Product Version NonStop SQL/MX Releases 3.1 Supported Release Version Updates (RVUs) This publication supports J06.12 and all subsequent J-series RVUs and H06.23 and all subsequent H-series RVUs, until otherwise indicated by its replacement publications. Part Number Published 663851-001 October 2011 TP663851.fm Page 2 Monday, October 17, 2011 11:48 AM Document History Part Number Product Version Published 640323-001 NonStop SQL/MX Release 3.0 February 2011 663851-001 NonStop SQL/MX Release 3.1 October 2011 TP663851.fm Page 1 Monday, October 17, 2011 11:48 AM Legal Notices Copyright 2011 Hewlett-Packard Development Company L.P. Confidential computer software. Valid license from HP required for possession, use or copying. Consistent with FAR 12.211 and 12.212, Commercial Computer Software, Computer Software Documentation, and Technical Data for Commercial Items are licensed to the U.S. Government under vendor's standard commercial license. The information contained herein is subject to change without notice. The only warranties for HP products and services are set forth in the express warranty statements accompanying such products and services. Nothing herein should be construed as constituting an additional warranty.