Challenges for the NoSQL systems

2013 ◽  
Vol 2 (1) ◽  
pp. 55-64
Author(s):  
George Tudorica Bogdan
Keyword(s):  
Open Source ◽  
Data Storage ◽  
Relational Databases ◽  
Query Interface ◽  
Academic World ◽  
Definition Of ◽  
Storage Structures ◽  
Sql Query

The concept described by the term NoSQL (Not Only SQL) is a database that is distributed, may not require fixed table schemas, usually avoids join operations and is typically horizontally scalable, it does not offer SQL query interface and is available in most cases as open source - some bibliographic sources use the term to refer to a completely unrelated system. This concept is also assimilated by sources in the academic world as a structured form of storage. The two terms seem not to be entirely equivalent; relational databases, for example, also meet the official definition of data storage structures, but they are somewhat opposite qualities to the concept of NoSQL. The aim of this paper is to discuss the challenges met by the NoSQL solutions and to propose solutions for these challenges.

The Hexagonal ↔ Orthorhombic Structural Phase Transition in Claringbullite, Cu4FCl(OH)6

2021 ◽  
Author(s):  
Mark D. Welch ◽  
Jens Najorka ◽  
Michael S. Rumsey ◽  
John Spratt
Keyword(s):  
Phase Transition ◽  
Data Storage ◽  
Structural Phase Transition ◽  
Structural Changes ◽  
Structural Phase ◽  
Magnetic Behavior ◽  
Orthorhombic Phase ◽  
New Mineral ◽  
Storage Devices ◽  
Definition Of

ABSTRACT Frustrated magnetic phases have been a perennial interest to theoreticians wishing to understand the energetics and behavior of quasi-chaotic systems at the quantum level. This behavior also has potentially wide applications to developing quantum data-storage devices. Several minerals are examples of such phases. Since the definition of herbertsmithite, Cu3ZnCl2(OH)6, as a new mineral in 2004 and the rapid realization of the significance of its structure as a frustrated antiferromagnetic phase with a triangular magnetic lattice, there has been intense study of its magnetic properties and those of synthetic compositional variants. In the past five years it has been recognized that the layered copper hydroxyhalides barlowite, Cu4BrF(OH)6, and claringbullite, Cu4FCl(OH)6, are also the parent structures of a family of kagome phases, as they also have triangular magnetic lattices. This paper concerns the structural behavior of claringbullite that is a precursor to the novel frustrated antiferromagnetic states that occur below 30 K in these minerals. The reversible hexagonal (P63/mmc) ↔ orthorhombic (Pnma or Cmcm) structural phase transition in barlowite at 200−270 K has been known for several years, but the details of the structural changes that occur through the transition have been largely unexplored, with the focus instead being on quantifying the low-temperature magnetic behavior of the orthorhombic phase. This paper reports the details of the structural phase transition in natural claringbullite at 100−293 K as studied by single-crystal X-ray diffraction. The transition temperature has been determined to lie between 270 and 293 K. The progressive disordering of Cu at the unusual trigonal prismatic Cu(OH)6 site on heating is quantified through the phase transition for the first time, and a methodology for refining this disorder is presented. Key changes in the behavior of Cu(OH)4Cl2 octahedra in claringbullite have been identified that suggest why the Pnma structure is likely stabilized over an alternative Cmcm structure. It is proposed that the presence of a non-centrosymmetric octahedron in the Pnma structure allows more effective structural relaxation during the phase transition than can be achieved by the Cmcm structure, which has only centrosymmetric octahedra.

scholarly journals Software Defined Storage Implementation Model to Data Centers

2020 ◽  
Vol 9 (1) ◽  
pp. 300-303
Keyword(s):  
Open Source ◽  
Data Centers ◽  
Great Benefit ◽  
Timely Manner ◽  
Implementation Model ◽  
Economic Level ◽  
Systems Software ◽  
Definition Of

This research focuses on deliver a SDS implementation model that facilitate the definition of requirements to be delivered in a timely manner to systems. Software Defined Storage (SDS) enables different hardware technologies to be homogenized and deliver independent storage. The technologies included on the implementation model are the open-source projects Red Hat Gluster Storage and Red Hat Ceph Storage. Both technologies are integrated into a virtualization platform, it is compared at a functional and economic level with respect to some enterprise solutions and it is shown that the same operations are performed as a viable technological alternative. The favorable results of the model are presented and the great benefit that open-source technologies have open scope that allows it to be integrated into other projects is presented.

Concepts of construction and technological solutions for methods of operative transfer of data of field researches from agricultural sites to the remote database of storage of data with a possibility of feedback

2020 ◽  
Vol 25 (1) ◽  
pp. 57-64
Author(s):  
Pisarenko V. ◽  
◽  
Pisarenko U. ◽  
Koval A. ◽  
Varava I.A. ◽  
...  
Keyword(s):  
Data Storage ◽  
High Probability ◽  
Data Transfer ◽  
Field Research ◽  
Urgent Problem ◽  
Research Institutions ◽  
Considerable Distance ◽  
Definition Of ◽  
Agricultural Areas ◽  
Operational Data

A feature of the agro-industrial sphere is the high probability of distribution (remoteness) of production or research sites in areas far from each other for a considerable distance. Moreover, the center for collecting information and processing it, as a rule, is concentrated in one compact place. For research institutions, this feature often acquires a state of rather urgent problem, which requires the search for new innovative approaches. The paper proposes elements of the concept of construction and technological solutions for methods of operational data transfer of field research from agricultural areas to a remote database for data storage with the possibility of feedback. As an example, the procedure of qualification examination of plant varieties with the definition of the criteria of "difference, homogeneity and stability" and "suitability for propagation of the variety in Ukraine" was chosen.

Parsing Character Arrays by Recursive Scoping and Structuring Using the Example of VRML Data

2021 ◽  
Vol 27 (4) ◽  
pp. 188-194
Author(s):  
D. V. Malakhovetsky ◽  
◽  
A. I. Razumowsky ◽  
Keyword(s):  
Data Storage ◽  
Heterogeneous Systems ◽  
Complex Object ◽  
Hierarchical Data ◽  
Analysis Method ◽  
Algorithmic Design ◽  
Parsing Algorithm ◽  
Recursive Data ◽  
Storage Structures ◽  
The Internet Of Things

Parsing character arrays by recursive scoping and structuring using the example of VRML data. The article presents a new method for structuring, segmentation and algorithmic design of the parser of character arrays using the example of VRML data. The key feature of the method is the ability to form a hierarchically complex object by means of recursive data structuring, which makes it possible to cover in aggregate the entire contents of the object, including its arbitrary nesting of child objects. This leads to high controllability of the development of the parsing algorithm, allowing you to focus each time on a specific piece of data, while not losing sight of the entire aggregate connectivity of information. The results obtained can easily be used in plans for creating convenient data storage structures related to information security, solving the problem of containing the amount of data in files, managing big data in heterogeneous systems, and processing hierarchical data in the Internet of Things. Keywords: data analysis method, parsing, structuring, se

Extraction and Critical Appraisal of Data

2013 ◽  
Author(s):  
Peter S. Curtis ◽  
Kerrie Mengersen ◽  
Marc J. Lajeunesse ◽  
Hannah R. Rothstein ◽  
Gavin B. Stewart
Keyword(s):  
Relational Databases ◽  
Critical Appraisal ◽  
Data Extraction ◽  
Meta Analysis ◽  
Research Question ◽  
Extraction Process ◽  
Research Review ◽  
Flat File ◽  
Microsoft Access ◽  
Definition Of

This chapter discusses the data extraction process, meta-analysis database, and critical appraisal of data. The efficient and accurate extraction of data from primary studies is an important component of successful research reviews. It is one of the most time-consuming parts of a research review and should be approached with the goal of repeatability and transparency of results. Careful definition of the research question and identification of the effect size metric(s) to be used are prerequisites to efficient data extraction. The extraction spreadsheet may simply be appended to a growing database stored in a single spreadsheet (also known as “flat file database”) (e.g., Microsoft Excel, Lotus, Quattro Pro), but it may be advantageous to develop relational databases (e.g., by using Microsoft Access, Paradox or dBase software), particularly for large or complex data. During the process of data extraction the investigator also has an opportunity for critical appraisal of data quality. One approach to quantitative assessment of study quality has been the use of numerical scales in which points are assigned to specific elements of the study and summed to produce an overall quality score.

NoSQL Databases

2014 ◽  
pp. 186-215 ◽  
Author(s):  
Ganesh Chandra Deka
Keyword(s):  
Cloud Computing ◽  
Big Data ◽  
Data Processing ◽  
Open Source ◽  
Data Storage ◽  
Big Data Processing ◽  
Nosql Databases ◽  
Data Intensive ◽  
Huge Data ◽  
Data Intensive Applications

NoSQL databases are designed to meet the huge data storage requirements of cloud computing and big data processing. NoSQL databases have lots of advanced features in addition to the conventional RDBMS features. Hence, the “NoSQL” databases are popularly known as “Not only SQL” databases. A variety of NoSQL databases having different features to deal with exponentially growing data-intensive applications are available with open source and proprietary option. This chapter discusses some of the popular NoSQL databases and their features on the light of CAP theorem.

Big Data and Simulations for the Solution of Controversies in Small Businesses

2018 ◽  
pp. 6907-6915
Author(s):  
Milena Janakova
Keyword(s):  
Big Data ◽  
Data Storage ◽  
Small Businesses ◽  
Mathematical Methods ◽  
The Road ◽  
True Story ◽  
Variable Level ◽  
Global Information Society ◽  
Definition Of ◽  
Many Sources

The global information society creates data in various formats and data is stored in many sources. Interest is focused on true story formation with respect to sustainable development. The suitable recommendation is to implement a multidimensional view on big data. Such an approach works with big data along three levels. Basic level represents default activities and analyses for data storage in data warehouse. Advanced level is focused on searching for links between stored data and information sources in the global society and variable level searches unexpected events based on complex statistics and mathematical methods with the support of Artificial Intelligence, Business Intelligence, Customer Intelligence, Competitive Intelligence, Swarm Intelligence. These kinds of activities are important for IT product development such as specification of the road for an adopted methodology, definition of a reference for needed dimensions and phases for IT development, and also as a warning against omissions and mistakes.

Modeling and Indexing Spatiotemporal Trajectory Data in Non-Relational Databases

2016 ◽  
pp. 133-162 ◽  
Author(s):  
Berkay Aydin ◽  
Vijay Akkineni ◽  
Rafal A Angryk
Keyword(s):  
Data Storage ◽  
Relational Databases ◽  
Large Scale ◽  
Database Systems ◽  
Distributed Database ◽  
Data Models ◽  
Trajectory Data ◽  
Nosql Databases ◽  
Distributed Database Systems ◽  
Partitioned Data

With the ever-growing nature of spatiotemporal data, it is inevitable to use non-relational and distributed database systems for storing massive spatiotemporal datasets. In this chapter, the important aspects of non-relational (NoSQL) databases for storing large-scale spatiotemporal trajectory data are investigated. Mainly, two data storage schemata are proposed for storing trajectories, which are called traditional and partitioned data models. Additionally spatiotemporal and non-spatiotemporal indexing structures are designed for efficiently retrieving data under different usage scenarios. The results of the experiments exhibit the advantages of utilizing data models and indexing structures for various query types.

scholarly journals RDF 1.1: Knowledge Representation and Data Integration Language for the Web

Symmetry ◽  
2020 ◽  
Vol 12 (1) ◽  
pp. 84 ◽  
Author(s):  
Dominik Tomaszuk ◽  
David Hyland-Wood
Keyword(s):  
Knowledge Representation ◽  
Resource Description Framework ◽  
Relational Databases ◽  
Formal Definition ◽  
Natural Languages ◽  
Description Framework ◽  
Generalized Knowledge ◽  
Definition Of ◽  
Resource Description ◽  
The Web

Resource Description Framework (RDF) can seen as a solution in today’s landscape of knowledge representation research. An RDF language has symmetrical features because subjects and objects in triples can be interchangeably used. Moreover, the regularity and symmetry of the RDF language allow knowledge representation that is easily processed by machines, and because its structure is similar to natural languages, it is reasonably readable for people. RDF provides some useful features for generalized knowledge representation. Its distributed nature, due to its identifier grounding in IRIs, naturally scales to the size of the Web. However, its use is often hidden from view and is, therefore, one of the less well-known of the knowledge representation frameworks. Therefore, we summarise RDF v1.0 and v1.1 to broaden its audience within the knowledge representation community. This article reviews current approaches, tools, and applications for mapping from relational databases to RDF and from XML to RDF. We discuss RDF serializations, including formats with support for multiple graphs and we analyze RDF compression proposals. Finally, we present a summarized formal definition of RDF 1.1 that provides additional insights into the modeling of reification, blank nodes, and entailments.

Evaluation of Quantified Statements Using Gradual Numbers

2011 ◽  
pp. 246-269 ◽  
Author(s):  
Ludovic Liétard ◽  
Daniel Rocacher
Keyword(s):  
Decision Making ◽  
Expert Systems ◽  
Set Theory ◽  
Fuzzy Set ◽  
Fuzzy Set Theory ◽  
Relational Databases ◽  
Fuzzy Numbers ◽  
Theoretical Background ◽  
Definition Of ◽  
Flexible Querying

This chapter is devoted to the evaluation of quantified statements which can be found in many applications as decision making, expert systems, or flexible querying of relational databases using fuzzy set theory. Its contribution is to introduce the main techniques to evaluate such statements and to propose a new theoretical background for the evaluation of quantified statements of type “Q X are A” and “Q B X are A.” In this context, quantified statements are interpreted using an arithmetic on gradual numbers from Nf, Zf, and Qf. It is shown that the context of fuzzy numbers provides a framework to unify previous approaches and can be the base for the definition of new approaches.

Sign in / Sign up

Export Citation Format

Share Document