Object-oriented Database Systems Research Articles

Some new fuzzy query processing methods based on similarity measurement and fuzzy data clustering

In relational and object-oriented database systems there is always data that is naturally fuzzy or uncertain. However, to deal with complex data types with fuzzy nature, these systems have many limitations. Therefore, in order to represent and manage fuzzy data, it is necessary to have a fuzzy interrogation system to facilitate non-expert users. To solve this challenge, the paper proposes two different approaches to increase the flexibility of the fuzzy interrogation system. Firstly, based on similarity measures and fuzzy logic, we develop three fuzzy query processing algorithms for single-condition and multi-condition cases such as FQSIMSC (Fuzzy Query Sim Single Condition), FQSIMMC (Fuzzy Query Sim Multi-Condition) and FQSEM (Fuzzy Query SEM). Secondly, we combine the fuzzy clustering algorithm EMC (Expectation maximization Coefficient) and the query processing algorithm that is based on fuzzy partitions FQINTERVAL (Fuzzy Query Interval). With this approach, we not only improve query processing cost but also support applications and devices equipped with intelligent interactive function that easily interacts with the fuzzy query system. The results of our theoretical and experimental analysis, it can be seen that both the proposed methods significantly reduce the processing time and memory space for a data set (extracted from UCI) that has a fuzzy and incomplete natural element with the resulting data size being optimal

User‐centered road network traffic analysis with MobilityDB

AbstractPerformance indicators of road networks are a long‐lasting topic of research. Existing schemes assess network properties such as the average speed on road segments and the queuing time at intersections. The increasing availability of user trajectories, collected mainly using mobile phones with a variety of applications, creates opportunities for developing user‐centered performance indicators. Performing such an analysis on big trajectory data sets remains a challenge for the existing data management systems, because they lack support for spatiotemporal trajectory data. This article presents an end‐to‐end solution, based on MobilityDB, a novel moving object database system that extends PostgreSQL with spatiotemporal data types and functions. A new class of indicators is proposed, focused on the users' experience. The indicators address the network design, the traffic flow, and the driving comfort of the motorists. Furthermore, these indicators are expressed as analytical MobilityDB queries over a big set of real vehicle trajectories.

The Design and Implementation of Network Assistant System for Physical Education

Sports teaching is a bilateral teaching activity, reflected in the process of the practice is very significant, the teaching process teachers should also carry out explanation and demonstration, through the vivid teaching methods to deepen students’ understanding, so that students have a higher and more comprehensive quality, adapt to future sports training and teaching, teaching more advanced the content of training and scientific research and management. The sports network teaching system in this paper, is based on the campus network, the Internet and other hardware based, and the efficiency of the network to play out, spread and the use of network teaching new teaching mode in the real sense, it is at this stage the industry needs to pay great attention to the problem and the solution. This paper describes the teaching effect of computer network technology in the sports teaching, and then combined with the specific application, detailed analysis of user needs; put forward the development scheme of PE teaching network aided system and Realization method. This system adopts the three layer system structure, good scalability, using modular design method, which is divided into teaching resources, online answering, course work and examination of four functional modules, easy to select the object-oriented ASP programming language, development environment and SQL Server database system extended the implementation of these key technologies include file upload processing technology, Active X programming technology and application, the file upload component development technology etc.

Development of Performance Evaluation Metrics of Concurrency Control in Object-Oriented Database Systems

Development of Performance Evaluation Metrics of Concurrency Control in Object-Oriented Database Systems

Development and Performance Evaluation of a Concurrency Control Technique in Object-Oriented Database Systems

Development and Performance Evaluation of a Concurrency Control Technique in Object-Oriented Database Systems

Query Processing in Object-oriented Database System of Sports Records Using Deductive Technique

본 연구에서는 스포츠 기록물 객체지향 데이터베이스 시스템의 개발을 위하여, 질의를 만족하는 데이터베이스의 값들인 외포적 답의 특성들을 나타내는 규칙으로 질의의 답을 표현하는 방법을 제안하고자 한다. 이 방법은 객체지향 데이터베이스 모델링과 추론적 데이터베이스에서 사용하는 질의 처리기법을 사용한다. 추론적 데이터베이스 시스템에서는 질의문에 대하여 식의 집합으로 응답할 수 있으므로, 질의 처리비용을 절감할 수 있으며, 데이터베이스 상태와는 독립적인 간결한 “내포적 답”으로 표현할 수 있다. 먼저 데이터베이스 시스템을 객체지향 기법을 이용하여 분석 대상인 스포츠 기록물을 계층 구조적으로 분류한다. 이런 분류 후, 규칙 표현(rule representation), 규칙 재구성(rule reformation), 선 분석(pre resolution), 분석(resolution)의 네 단계 알고리즘을 적용하여 질의의 답을 구할 수 있는데, 이 논문에서는 빙상 종목을 예로 사용하여 경기종목, 주 종목, 성별과 최고기록 등으로 질의에 대한 내포적 답을 제시할 수 있음을 보였다. 이 연구에서 제시한 알고리즘은 선수들의 경기력 진단 및 맞춤형 훈련에도 활용 수 있으며 객관적이고 효율적인 국가대표선수 선발에도 적용할 수 있다. 본 연구는 융합 연구가 아니면 할 수 없는 것으로 스포츠 분야에서의 융합 연구의 발전에도 크게 기여할 것이다.In this paper, we propose a method, for the purpose of the development of sports records object–oriented database system, to express answers to queries as a set of rules representing the characteristics of the external answers, which are a set of values in the database satisfying the queries. The method is based on an object-oriented databases modeling and a query processing method in the deductive database. The deductive database systems obtain the answer to a query as a set of formulas, thereby reduce the costs to process the query, and represent its “intensional answers” in a more compact way independently of the database state. We first classify hierarchically the object of analysis, the sports records, using the object-oriented technique of database system. Then the answer to the query can be obtained by applying the four-step algorithm of rule representation, rule reformation, pre-resolution, and resolution. In this paper we show utilizing skating as an example that an intensional answer to a query can be obtained based on the athletic events, main events, gender, and the best record. The algorithm proposed in this paper can be used for athletic evaluation and training, and applied effectively even for objective selection of national athletes. This research will make an important contribution to the development of interdisciplinary research on various areas of sports, where integrated research is essential.

An intelligent multimedia information system for multimodal content extraction and querying

This paper introduces an intelligent multimedia information system, which exploits machine learning and database technologies. The system extracts semantic contents of videos automatically by using the visual, auditory and textual modalities, then, stores the extracted contents in an appropriate format to retrieve them efficiently in subsequent requests for information. The semantic contents are extracted from these three modalities of data separately. Afterwards, the outputs from these modalities are fused to increase the accuracy of the object extraction process. The semantic contents that are extracted using the information fusion are stored in an intelligent and fuzzy object-oriented database system. In order to answer user queries efficiently, a multidimensional indexing mechanism that combines the extracted high-level semantic information with the low-level video features is developed. The proposed multimedia information system is implemented as a prototype and its performance is evaluated using news video datasets for answering content and concept-based queries considering all these modalities and their fused data. The performance results show that the developed multimedia information system is robust and scalable for large scale multimedia applications.

On querying and mining semantic-aware mobility timelines

The explosion of available positioning information associated with the inferred or user-declared semantics of the respective locations has contributed in what is called the Big Data era by posing new challenges to the mobility data management and mining research community. Motivated by a series of challenges posed in Pelekis et al. (SIGKDD Explor 15(1):23–32, 2013), in this paper, we present a unified framework for the management and the analysis of LifeSteps, i.e., data objects about human mobility including both (raw) spatio-temporal trajectories and their semantic counterpart. In particular, we provide solutions for developing real-world semantic-aware moving object database and trajectory data warehouse systems and we devise respective query processing algorithms. Our experimental study on realistic synthetic data including synchronized raw (i.e., GPS log) and semantic (i.e., diaries) information verifies the effectiveness and efficiency of the proposed framework.

HEURISTIC ALGORITHM FOR FRAGMENTATION AND ALLOCATION IN DISTRIBUTED OBJECT ORIENTED DATABASE

Class fragmentation and allocation is an important technique to improve the performance of a distributed object oriented database system. The class fragmentation is to split a class into smaller pieces in distributed databases aims to reduce the access to unnecessary data, the allocation is to locate fragmented classes into the sites in the connected network properly to reduce the cost of data transmission. Classes in object databases include attributes describing the characteristics of the object, methods describing the behavior, and relationships with objects with other classes, including relations inheritance. With such characteristics, class fragmentation and allocation in the distributed object oriented database system is more complex than fragmentation technique and design of relational databases. Fragmentation techniques applied in the design of distributed object-oriented database today often do not use cost between the sites, fragments are allocated to the site after getting a fragmentation method of data objects. This paper proposes an algorithm of fragmentation and allocation simultaneously, including the cost of data communication between the sites used for fragmentation to reduce communication costs when processing and querying distributed data.

On the Management and Analysis of Our LifeSteps

Huge volumes of location information are available nowadays due to the rapid growth of positioning devices (GPS-enabled smartphones and tablets, on-board navigation systems in vehicles, vessels and planes, smart chips for animals, etc.). In the near future, it is unavoidable that this explosion will contribute in what is called the Big Data era, raising high challenges for the data management research community. Instead of trying to manage bigger and bigger volumes of raw data, future Moving Object Database (MOD) systems need to extract and manage (the minimum necessary) semantics of movement. Such semantics can foster next-generation location-based services (LBS) and locationbased social networking (LBSN) applications, building more efficient and effective applications, while in parallel opening new research directions in the field of transportation, urban planning etc. In this article, we first present a novel model that enables the unified management of (raw GPS) trajectories and their semantic counterpart, and then we discuss challenges and solutions on the multidimensional analysis of such real-world semantic-aware mobility databases and data warehouses. Our recent experience from an interdisciplinary EU project we've been participating makes us confident that the envisioned approach will inspire the next wave of research in mobility data management and exploration field.

Group spatiotemporal pattern queries

Group spatiotemporal patterns are certain formations, in space and time, shown by groups of moving objects, such as flocks, concurrence, encounter, etc. A large number of recent applications focus on the collective behavior of moving objects, rather than the individual movements. Therefore finding such groups in moving object databases is crucial. There exist, in the literature, smart algorithms for matching some of these patterns. These solutions, however, address specific patterns and require specialized data representation and indexes. They share too little to be integrated into a single system. There is a need for a generic query method that allows users to fill in pattern descriptions, and retrieve the set of matches. In this paper, we propose generic query operators that can consistently express and match a wide range of group spatiotemporal patterns. We formally define these operators, illustrate the evaluation algorithms, and discuss the issues of their integration with moving object database (MOD) systems. These operators have been implemented in the context of Secondo MOD system, and the implementation is available online as open source. Several examples are given to showcase the expressive power of the operators. We have made available scripts that can be invoked from the Secondo interface to automatically repeat some of the experiments in this paper.

A Framework for Object-Oriented Data Mining Based on Higher-Order Logic Programming

Data mining discovers knowledge and useful information from large amounts of data stored in databases. With the increasing popularity of object-oriented database system in advanced database applications, it is significantly important to study the data mining methods for object-oriented database. This paper proposes that higher-order logic programming languages and techniques is very suitable for object-oriented data mining, and presents a framework for object-oriented data mining based on higher-order logic programming. Such a framework is inductive logic programming which adopts higher-order logic programming language Escher as knowledge representation formalism. In addition, Escher is a generalization of the attribute-value representation, thus many higher-order logic learners under this framework can be upgraded directly from corresponding propositional learners.

Fuzzy Object Oriented Database versus FRDB for Uncertainty Management

It is impossible to capture all of the semantics of real world information and to model it in a perfect way. Uncertain information being lacking information, individual interpretation of knowledge is taken into account. Most widely used relational model faced much difficulty to handle complex data requirements. The size of databases and their changing composition such as graphics, video and sound, as well as numbers and text invited a reorganization of existing information systems. Object oriented database draw their strength from graphical user interfaces, advanced data management capabilities and powerful modeling techniques. So in order to deal with inexactness fuzzy techniques have been extensively integrated with more advanced object oriented database system which is capable to represent and manipulate the complex objects as well as complicated and uncertain relationship exiting among them. In this paper uncertainty using Fuzzy Object Oriented Database and Fuzzy Relational Data Base is illustrated.

Using a taxonomy for your database or website: A look behind the scenes

AbstractEditor's SummaryPeering behind the screen of a database or website reveals the methods and benefits of incorporating a taxonomy. A digital taxonomy file contains terms, term records with details of relationships and a hierarchical structure. The terms are used to categorize content and apply as metanames describing website content items. Digging deeper, the taxonomy terms are stored and associated with a relational database management system, object‐oriented database or XML‐based database system. Taxonomy terms can be presented to the end user in a browsable format along with term record details for additional guidance. Captured in the inverted index of search software, the terms promote findability and search success. Documents with taxonomy terms attached can be accurately retrieved regardless of where they are held, and terms can be repurposed as site labels and points of association between internal content items.

Representation of Object-Oriented Database for the Development of Web Based Application Using Db4o

Impedance mismatch of data flow is the major problem in the relational database when one is using the web based application development on the computer system. It effects the development of scalable and reusable web application. Due to this, the research cost of development and maintenance increases. Therefore the present work is an attempt towards an object-oriented database system by using Db4o to overcome the impedance mismatch problem. In the current work, the development of web application for Indian Postal Services by using Db4o is demonstrated on dot NET platform. Before developing the application, the authors used a Unified Modeling Language (UML) model in the form of UML class, sequence and use-case diagrams. The Db4o is used to store the object-oriented database and the performance of Db4o is observed through several object-oriented queries and corresponding results are demonstrated.

An adaptive updating protocol for reducing moving object database workload

In the last decade, spatio-temporal database research focuses on the design of effective and efficient indexing structures in support of location-based queries such as predictive range queries and nearest neighbor queries. While a variety of indexing techniques have been proposed to accelerate the processing of updates and queries, not much attention has been paid to the updating protocol, which is another important factor affecting the system performance. In this paper, we propose a generic and adaptive updating protocol for moving object databases with less number of updates between objects and the database server, thereby reducing the overall workload of the system. In contrast to the approach adopted by most conventional moving object database systems where the exact locations and velocities last disclosed are used to predict their motions, we propose the concept of Spatio-temporal safe region to approximate possible future locations. Spatio-temporal safe regions provide larger space of tolerance for moving objects, freeing them from location and velocity updates as long as the errors remain predictable in the database. To answer predictive queries accurately, the server is allowed to probe the latest status of objects when their safe regions are inadequate in returning the exact query results. Spatio-temporal safe regions are calculated and optimized by the database server with two contradictory objectives: reducing update workload while guaranteeing query accuracy and efficiency. To achieve this, we propose a cost model that estimates the composition of active and passive updates based on historical motion records and query distribution. More system performance improvements can be obtained by cutting more updates from the clients, when the users of system are comfortable with incomplete but accuracy bounded query results. We have conducted extensive experiments to evaluate our proposal on a variety of popular indexing structures. The results confirm the viability, robustness, accuracy and efficiency of our proposed protocol.

Transformation of UML Class Diagram for Object Oriented Database System

a-days use of objects is a common approach in all aspects of computing. An Object-Oriented database can utilize the benefits of both the design and implementation of any application. Object-Oriented database System is the fusion of Database Management System with Object-Oriented System. UML provides stable and industry standard notation for object- oriented analysis and design models. A case study of NSC scheme of Indian Postal Services is considered for storing the data using object database modeling. UML class diagram and sequence diagram are constructed for the post office system and then the transformation of class diagram is done for the ease of understanding and working.

On experiences of i2b2 (Informatics for integrating biology and the bedside) database with Japanese clinical patients' data.

Informatics for Integrating Biology and the Bedside (i2b2) is a database system to facilitate sharing and reuse of clinical patients' data collected in individual hospitals. The i2b2 provides an ontology based object-oriented database system with highly simple and flexible database schema which enables us to integrate clinical patients' data from different laboratories and different hospitals. 392 patients' data including carcinoma and non-carcinoma specimens from cancer patients are transported from the Integrated Clinical Omics Database (iCOD) to the i2b2 database for a feasibility study to check applicability of i2b2 ontology and database schema on Japanese clinical patients' data. No modification is required for the i2b2 data model to deal with Japanese characters. Some modification of ontology is required to integrate biomedical information extracted from the cancer patients' data. We believe that the i2b2 system will be practical infrastructure to integrate Japanese clinical databases if appropriate disease ontology for Japanese patients is provided.

Moving Query Monitoring in Spatial Network Environments

Moving queries over mobile objects are an important type of query in moving object database systems. In recent years, there have been quite a few works in this area. Due to the high frequency in location updates and the expensive cost of continuous query processing, server computation capacity and wireless communication bandwidth are the two limiting factors for large-scale deployment of moving object database systems. Many techniques have been proposed to address the server bottleneck including one using distributed servers. To address both scalability factors, distributed query processing techniques have been considered. These schemes enable moving objects to participate in query processing to substantially reduce the demand on server computation, and wireless communications associated with location updates. Most of these techniques, however, assume an open-space environment. Since Euclidean distance is different from network distance, techniques designed specifically for an open space cannot be easily adapted for a spatial network. In this paper, we present a distributed framework which can answer moving query over moving objects in a spatial network. To illustrate the effectiveness of the proposed framework, we study two representative moving queries, namely, moving range queries and moving k-nearest-neighbor queries. Detailed algorithms and communication mechanisms are presented. The simulation studies indicate that the proposed technique can significantly reduce server workload and wireless communication cost.

The Research on Coding Scheme of Binary-Tree for XML

Usually, there are four different options when store and query the XML data: Firstly, use the file system; secondly, use relational database system; thirdly, use object-oriented database system; fourthly, establish a special database system known as the native XML database system, such as Tamino, TextML. In order to effectively support the query, for the query in the structure of the XML, one method is establishing the path index of the XML documents tree, and speeding up the calculation capability to the query in the structure of the XML by the path index; another method is encoding the XML document tree nodes, that is, giving a unique code to each node of the XML document tree in order to directly identify the structural relationship in the nodes using the codes, rather than traverse the original XML documents. In other words, it is through coding to change calculations of the query in the structure of XML into calculations of the connection in it.