Data Storage Model Research Articles

A Method of Numbered STL File Format for Recording Data

The paper has proposed an improved method of recording data in STL file format against disadvantages, such as high repetition of recording triangular meshes data and complex computation of vertex coordinate. Vertexes and normal vectors of triangular meshes are renumbered, and meshes data expressed by coordinate is changed into data stored by number. It facilitates the recording of triangular meshes data of depth images and provides a more simple way for establishing data storage model.

A Secondary Pretreatment Method of Particled Graph

According to the coordinates of the particled graph, the paper presents a secondary pretreatment method which is invariant to translation, scaling and rotation. Having the advantages of efficient and accurate, the new method is significant to image processing. As the core of the pretreatment, orientation pretreatment is described in detail. In combination with the semi-structured data storage model, the new pretreatment method can help to achieve image content retrieval and data mining of a deeper level.

Application Research on Real-Time Database System Model Based on Distributed System of Cloud Manufacturing

This paper analyzed on real-time database system, and applied the cloud manufacturing technology and distributed system technology to the database system model. Through the analysis on the real time database, we can got the distributed real-time data system types and data storage model, establish two kinds of memory T-mode and S-mode, database storage model and make the production of block. Finally establish the work flow of distributed real-time database system, get relevant application program. A large number of real-time data collection and administration can be realized, which can improve the real-time information data processing efficiency and system model performance. Through the establishment of model and analysis of its working process in the real-time distributed system real time database application path, it can provide guidance for the establishment of distributed real-time database system model.

Key Technologies of Cloud Computing Model

Could computing is a new type of computing mode, it distributes computation task on the resource pool which consists of massive computers, so the application systems can obtain the computation power, the storage space and software service according to its demand. The understanding of cloud computing is developing and changing constantly, cloud computing still has no unanimous definition. This paper describes three main service forms of cloud computing: SAAS, PAAS, IAAS, compared the definition of cloud computing which is given by Google, Amazon, IBM and other companies, summarized the basic characteristics of cloud computing, and emphasized on the key technologies such as data storage, data management, virtualization and programming model.

Comparisons of three data storage models in parametric temporal databases

The parametric temporal data model captures a real world entity in a single tuple, which reduces query language complexity. Such a data model, however, is difficult to be implemented on top of conventional databases because of its unfixed attribute sizes. XML is a matured technology and can be an elegant solution for such challenge. Representing data in XML trigger a question about storage efficiency. The goal of this work is to provide a straightforward answer to such a question. To this end, we compare three different storage models for the parametric temporal data model and show that XML is not worse than any other approaches. Furthermore, XML outperforms the other storages under certain conditions. Therefore, our simulation results provide a positive indication that the myth about XML is not true in the parametric temporal data model.

Crowdsourced Trace Similarity with Smartphones

Smartphones are nowadays equipped with a number of sensors, such as WiFi, GPS, accelerometers, etc. This capability allows smartphone users to easily engage in crowdsourced computing services, which contribute to the solution of complex problems in a distributed manner. In this work, we leverage such a computing paradigm to solve efficiently the following problem: comparing a query trace Q against a crowd of traces generated and stored on distributed smartphones. Our proposed framework, coined SmartTrace <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">+</sup> , provides an effective solution without disclosing any part of the crowd traces to the query processor. SmartTrace <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">+</sup> , relies on an in-situ data storage model and intelligent top-K query processing algorithms that exploit distributed trajectory similarity measures, resilient to spatial and temporal noise, in order to derive the most relevant answers to Q. We evaluate our algorithms on both synthetic and real workloads. We describe our prototype system developed on the Android OS. The solution is deployed over our own SmartLab testbed of 25 smartphones. Our study reveals that computations over SmartTrace <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">+</sup> result in substantial energy conservation; in addition, results can be computed faster than competitive approaches.

대용량 컬럼 저장소를 위한 교차 압축 이중화 기법

The column-oriented database storage is a very advanced model for large-volume data analysis systems because of its superior I/O performance. Traditional data storages exploit row-oriented storage where the attributes of a record are placed contiguously in hard disk for fast write operations. However, for search-mostly datawarehouse systems, column-oriented storage has become a more proper model because of its superior read performance. Recently, solid state drive using MLC flash memory is largely recognized as the preferred storage media for high-speed data analysis systems. In this paper, we introduce fast column-oriented data storage model and then propose a new storage management scheme using a cross compressed replication for the high-speed column-oriented datawarehouse system. Our storage management scheme which is based on two MLC SSD achieves superior performance and reliability by the cross replication of the uncompressed segment and the compressed segment under high workloads of CPU and I/O. Based on the results of the performance evaluation, we conclude that our storage management scheme outperforms the traditional scheme in the respect of update throughput and response time of the column segments.

A Split-Path Schema-Based RFID Data Storage Model in Supply Chain Management

In modern supply chain management systems, Radio Frequency IDentification (RFID) technology has become an indispensable sensor technology and massive RFID data sets are expected to become commonplace. More and more space and time are needed to store and process such huge amounts of RFID data, and there is an increasing realization that the existing approaches cannot satisfy the requirements of RFID data management. In this paper, we present a split-path schema-based RFID data storage model. With a data separation mechanism, the massive RFID data produced in supply chain management systems can be stored and processed more efficiently. Then a tree structure-based path splitting approach is proposed to intelligently and automatically split the movement paths of products. Furthermore, based on the proposed new storage model, we design the relational schema to store the path information and time information of tags, and some typical query templates and SQL statements are defined. Finally, we conduct various experiments to measure the effect and performance of our model and demonstrate that it performs significantly better than the baseline approach in both the data expression and path-oriented RFID data query performance.

TCLOUD: A New Model of Data Storage Providing Public Verifiability and Dynamic Data Recovery for Cloud Computing

Cloud computing is a new paradigm of computing and is considered to be the next generation of information technology infrastructure for an enterprise. The distributed architecture of cloud data storage facilitates the customer to get benefits from the greater quality of storage and minimized the operating cost. This technology also brought numerous possible threats including data confidentiality, integrity and availability. A homomorphic based model of storage is proposed, which enable the customer and a third party auditor to perform the authentication of data stored on the cloud storage. This model performs the verification of huge file’s integrity and availability with less consumption of computation, storage and communication resources. The proposed model also supports public verifiability and dynamic data recovery.

Enhancing Privacy in Cloud Service Provider Using Cryptographic Algorithm

Cloud Computing provides the way to share the distributed resources and services that belong to different organizations and sites. Even though it having benefits, but it posses security problems. All types of users who require the secure transmission or storage of data in network. While, the data transmission on the internet or over any networks are vulnerable to the hacker attacks. We are in great need of encrypting the owner data. Our paper aims to give the cloud data storage models and data security in cloud computing system. Here we propose a efficient method for providing data storage security in cloud computing using RSA algorithm. In this algorithm some important security services included such as key generation, encryption and decryption that are provided in cloud computing system.

Multi-Source Spatial Data Distribution Model and System Implementation

The Multi-source spatial data distribution is based on WebGIS, and it is an important part of multi-source geographic information management system. a new multi-source spatial data distribution model is proposed on the basis of multisource data storage model and by combining existing map distribution technology, The author developed a multi-source spatial data distribution system which based on MapGIS K9 by using this model and taking full advantage of interfacecode separating thinking and high efficiency characteristic of .net, so high-speed distribution of multi-source spatial data realized.

The technical security issues in cloud computing

With the development of multi-core processors, virtualisation, distributed storage, broadband internet and automatic management, a new type of computing mode named cloud computing is produced. The cloud computing has drastically altered everyone's perception of infrastructure architectures, software delivery and development models. Cloud computing adoption and diffusion are threatened by unresolved security issues that affect both the cloud provider and the cloud user. A secure data storage architecture based on cloud computing is presented in this paper to deal with the data security in the cloud storage systems and applications. This architecture research, the security issues from data storage and data security including the data storage model based on caching and data security model based on the third party secure publication. This method improves the high availability of data. Protection measures from the data storage to transmission are taken to ensure safety.

Design and Implementation of Bi-Direction Real-Time Traffic Electronic Map

Information integration based on GIS is the key of digital city. Taking the integration of real-time traffic information and basic geography data as an example, the model of data storage, data illustration and information display were analyzed. Data was stored in TAB format, and was read and written using Mitab open source library. VGLibrary was developed based on MiniGUI to draw vector graphics, e.g. symbol, parallel polyline, polygon. At last, the application has functionality of viewing, roaming and zooming an electronic map. The design takes loose coupling method and efficiently integrates other information with basic geographic data.

Data Storage Model for Laser CDs

In this paper, we present an analysis of the data capacity for different types of laser disc technologies. Two design factors, laser wavelength (infrared, red or blue) and disc drive mechanics (CLV or CAV) are studied, and brief introductions to these two design factors are given. Moreover, diffraction, technical data and background information about disc drive mechanics are discussed, the conclusion is drawn that CAV-type is more than CLV type of capacity, consistent with its production principles.

Where should electronic records for patients be stored?

IntroductionThe importance of a nationwide health information infrastructure (NHII) is widely recognized. Patient data may be stored where it happens to be created (the distributed or institution-centric model) or in one place for a given patient (the centralized or patient-centric model). Minimal data is available regarding the performance implications of these alternative architectural choices. ObjectiveTo help identify the architecture best suited for efficient and complete nationwide health information exchange based on the large-scale operational characteristics of these architectures. DesignWe used simulation to study the impact of health care record (data) fragmentation and probability of encounter on transaction volume and data retrieval failure rate as markers of performance for each of the above architectures. ResultsData fragmentation and the probability of encounter directly correlate with transaction volume and are significantly higher for the distributed model when the number of data nodes >4 (p<0.0001). The number of data retrieval failures increases in proportion to fragmentation and is significantly higher for the distributed model when the number of data nodes ≥2 (p<0.0059). ConclusionIn simulation studies, the distributed model scaled poorly in terms of data availability and integrity with a higher failure rate when compared to the centralized model of data storage. Choice of architecture may have implications on the efficiency, usability, and effectiveness of the NHII at the point of care.

Intelligent search in social communities of smartphone users

Social communities of smartphone users have recently gained significant interest due to their wide social penetration. The applications in this domain, however, currently rely on centralized or cloud-like architectures for data sharing and searching tasks, introducing both data-disclosure and performance concerns. In this paper, we present a distributed search architecture for intelligent search of objects in a mobile social community. Our framework, coined SmartOpt, is founded on an in-situ data storage model, where captured objects remain local on smartphones and searches then take place over an intelligent multi-objective lookup structure we compute dynamically. Our MO-QRT structure optimizes several conflicting objectives, using a multi-objective evolutionary algorithm that calculates a diverse set of high quality non-dominated solutions in a single run. Then a decision-making subsystem is utilized to tune the retrieval preferences of the query user. We assess our ideas both using trace-driven experiments with mobility and social patterns derived by Microsoft's GeoLife project, DBLP and Pics `n' Trails but also using our real Android SmartP2P ( http://smartp2p.cs.ucy.ac.cy/ ) system deployed over our SmartLab ( http://smartlab.cs.ucy.ac.cy/ ) testbed of 40+ smartphones. Our study reveals that SmartOpt yields high query recall rates of 95 %, with one order of magnitude less time and two orders of magnitude less energy than its competitors.

Two-Dimensional Equalization Using Bilinear Recursive Polynomial Model for Holographic Data Storage Systems

In this paper, we propose new two-dimensional (2D) nonlinear equalizers developed on the basis of a bilinear recursive polynomial (BRP) model for holographic data storage (HDS) systems. The 2D BRP equalizer (BRPE) and the 2D BRP decision feedback equalizer (BRPDFE) are proposed. The bit error rate (BER) performances of the proposed schemes are studied in the electrical-noise-dominant channel (ENDC) and the optical-noise-dominant channel (ONDC). The proposed schemes are compared with the conventional adaptive DFE and the partial response maximum likelihood (PRML) detector. The simulation results show that the proposed schemes outperform the adaptive DFE and the PRML detector. In particular, the BRPDFE shows the best BER performance in both the ENDC and the ONDC.

Research on YH30 Hydraulic Press Parts’s Model Expression Based on XML

This article is in view of the model data storage the problems in the process of interaction, through the XML data intermediate storage method, of the hydraulic press for each model will be stored in the characteristic dimensions in the XML document, according to the predetermined XML Schema (XML Schema Definition, XSD), more articulate products of various kinds of CAD model design information. In this way the data exchange, this model of data kept the way to avoid inconsistencies, transfer of data volume is small, and not in the different between platform to transmit documents appear data loss, data distortion phenomenon, for the follow-up of CAE/CAM analysis with good books.

A simulation approach for optimal design of RFID sensor tag-based cold chain systems

This study introduced a systematic approach for assessing alternative operational models and to determine optimal values for some of the core design parameters in an RFID sensor tag-based cold chain system. First of all, we defined an RFID and sensor data collection and storage model. Next, we developed an RFID sensor tag-based cold chain simulation model and a simulator based on Discrete Event System Specification (DEVS) formalism. Finally, based on a case study, we demonstrated a procedure for determining the optimal sensing interval value with the proposed simulator. The results from the case study have shown that the proposed approach presents important advantages to analyze the Key Performance Indicator (KPI) of cold chain systems according to changes of RFID sensor tag-based cold chain system’s operation models and parameter values.

SD-miner System to Retrieve Probabilistic Neighborhood Points in Spatial Data Mining

In GIS or Geographic Information system technology, a vast volume of spatial data has been accumulated, thereby incurring the necessity of spatial data mining techniques. Displaying and visualizing such data items are important aspects. But no RDBMS software is loaded with displaying the spatial result over a MAP overlay or answer spatial queries like all the points within certain Neighborhood. In this project, we propose a new spatial data mining system named SD-Miner. SD-Miner consists of three parts: A Graphical User Interface for inputs and outputs, a Data Mining Module that processes spatial data mining functionalities, a Data Storage Model that stores and manages spatial as well as non-spatial data by using a DBMS. In particular, the data mining module provides major spatial data mining functionalities such as spatial clustering, spatial classification, spatial characterization, and spatio-temporal association rule mining. SD-Miner has its own characteristics: (1) It supports users to perform non-spatial data mining functionalities as well as spatial data mining functionalities intuitively and effectively. (2) It provides users with spatial data mining functions as a form of libraries, thereby making applications conveniently use those functions. (3) It inputs parameters for mining as a form of database tables to increase flexibility. Result shows that significantly reduced and precise data items are displayed through the result of this technique.