Hierarchical Database Structure Research Articles

Database Management System in Accounting: Assessing the Role of Internet Service Communication of Accounting System Information

Data management is part of information resource management which includes all activities that ensure that company data resources are accurate, up-to-date, and safe from tampering, and are also available to users and the company. This study aims to find out about the role of concept database management in managing large volumes of company data. The result showed that data management activities include data collection, integrity, and testing, storage, maintenance, security, organization, retrieval. Meanwhile, the database structure includes hierarchical database structure, network database structure, and relational database structure.

A Novel Fault Prevention Model for Metro Overhead Contact System

As an indispensable part of metro traction power supply system, the metro overhead contact system (OCS) is complex in composition and has various causes of faults, so its fault prevention is too complicated to be handled by using traditional methods. However, over the last few years, the fault data of metro OCS has been through explosive growth. Consequently, the method of high utility mining, which is capable of pointedly mining fault association rules from historical fault data, is adapted to address the issue. According to the fault association rules, once the precursor of the specified fault occurs, we can immediately conduct preventive maintenance to achieve the purpose of fault prevention. In this paper, we proposed a novel fault prevention model for metro OCS. First, we proposed a concept hierarchical database structure with a detailed encoding method, which can efficiently store the massive fault data and facilitate the subsequent mining. Then an improved algorithm for mining multiple-level top-K high utility fault-sets (MTHU) for metro OCS is proposed. At last, a case study is conducted and the mining result is analyzed to reveal the inner connections between faults. Based on the analysis result, the detailed preventive maintenance suggestions are given to effectively achieve fault prevention for OCS.

A Proxy based Framework for Efficient Range Query Processing in a Cellular Network

Within the last decade, the continuous development of mobile technology has motivated an intense research in mobile data services. Among these services, location-based services and location-dependant queries have attracted a lot of attention from the software industry as well as from researchers. Although a number of locations based service methods have been proposed, the performance is not satisfactory in the case of dynamic data management problems that introduce high overhead in update and query operations. In this paper, we introduce a proxy based distributed dynamic data management architecture for location based services that reduces network cost with required quality of service (QoS). The system proposes a distributed hierarchical database structure with collocated proxy for efficient service delivery to location-dependant queries especially Range Queries (RQ). The system that we propose have the following advantages. i) It performs efficient processing of location dependant queries, especially Range Queries spanning over multiple network cells ii) It reduces wireless communication between mobile devices and servers. iii) The system is scalable where location data is distributed and arranged hierarchically. We use proxy objects to carry out processing task for each mobile user. Thus proxies play an important role and in charge of routing the queries to different (distributed) databases and present the results to queries efficiently. Simulation study shows the effectiveness of our proposed architecture.

Electronic Freight Theft Management System for Florida

An electronic freight theft management system has recently been developed by the Center for Advanced Transportation Systems Simulation. The system was designed to be a comprehensive online application for the reporting, documentation, and warehousing of information on intermodal freight theft and related occurrences. A hierarchical database structure is the foundation for data capture, storage, and retrieval. System deployment is intended to benefit conglomerate corporations, independent sole proprietor commercial vehicle operators, and law enforcement agencies. The online system can be used to assist law enforcement in prioritizing theft investigations or recovery operations by the significance level of the stolen cargo. If deployed nationally, it would offer criminal investigation officers a universal freight theft data system with interjurisdictional application and versatility to assist in cross-reference of available data through any available Internet connection and web browser. The system has been structured to allow application of data mining techniques to the database. The system has simplicity and scalability without loss of performance and has built-in alerts to identify stolen commodities that pose a possible threat to national homeland security. A system for Florida law enforcement has been designed and deployed. The new web-based system replaced the previous paper-based system that used a fax machine to distribute theft reports. The new system distributes reports and bulletins electronically via automated e-mails. This enhancement is projected to reduce response time significantly, provide greater accessibility to available data for officers, and increase the ability to provide more accurate theft recovery information.

Location management in cellular mobile computing systems with dynamic hierarchical location databases

An important issue in the design of a mobile computing system is how to manage the location information of mobile clients. In the existing commercial cellular mobile computing systems, a two-tier architecture is adopted. However, the two-tier architecture is not scalable. In the literatures, a hierarchical database structure is proposed in which the location information of mobile clients within a cell is managed by the location database responsible for the cell. The location databases of different cells are organized into a tree-like structure to facilitate the search of mobile clients. Although this architecture can distribute the updates and the searching workload amongst the location databases in the system, location update overheads can be very expensive when the mobility of clients is high. In this paper, we study the issues on how to generate location updates under the distance-based method for systems using hierarchical location databases. A cost-based method is proposed for calculating the optimal distance threshold with the objective to minimize the total location management cost. Furthermore, under the existing hierarchical location database scheme, the tree structure of the location databases is static. It cannot adapt to the changes in mobility patterns of mobile clients. This will affect the total location management cost in the system. In the second part of the paper, we present a reorganization strategy to restructure the hierarchical tree of location databases according to the mobility patterns of the clients with the objective to minimize the location management cost. Extensive simulation experiments have been performed to investigate the reorganization strategy when our location update generation method is applied.

Hierarchical discriminant analysis for image retrieval

A self-organizing framework for object recognition is described. We describe a hierarchical database structure for image retrieval. The self-organizing hierarchical optimal subspace learning and inference framework (SHOSLIF) system uses the theories of optimal linear projection for optimal feature derivation and a hierarchical structure to achieve logarithmic retrieval complexity. A space-tessellation tree is generated using the most expressive features (MEF) and most discriminating features (MDF) at each level of the tree. The major characteristics of the analysis include: (1) avoiding the limitation of global linear features by deriving a recursively better-fitted set of features for each of the recursively subdivided sets of training samples; (2) generating a smaller tree whose cell boundaries separate the samples along the class boundaries better than the principal component analysis, thereby giving a better generalization capability (i.e., better recognition rate in a disjoint test); (3) accelerating the retrieval using a tree structure for data pruning, utilizing a different set of discriminant features at each level of the tree. We allow for perturbations in the size and position of objects in the images through learning. We demonstrate the technique on a large image database of widely varying real-world objects taken in natural settings, and show the applicability of the approach for variability in position, size, and 3D orientation. This paper concentrates on the hierarchical partitioning of the feature spaces.

Automatic Evolution of a Decision-Supporting Design Project Database in Concurrent Control Engineering

Concurrent Control Engineering aims at multidisciplinary integration of control engineering methods with the data and procedures of complementary engineering disci-plines in view of holistic system optimization This necessitates an iterative and interactive multi-objective search-based design approach its take care of the variety of analysis and design objectives both of a control specific and a multidisciplinary nature. However, the complexity of a multi-objective design process grows with project time as a function of the variability of design decisions and the quantity of design data to be analysed. This requires a top-down design systematic as a framework for explicit decision support and problem decomposition. Such a framework is developed. It leads to a hierarchical database structure where the decision strata of modelling, criteria formulation, and design parameter specification, correspond to the hierarchical strata of a database. Furthermore, a search-based design must allow backtracking and branching of the decision process. This requires a design database with easily recoverable design informations. Specific database management modules are realized within ANDECS_MOPS2) for a com-puterized evolution of such a database as design proceeds. It allows the comparison of any design outcomes at any time (backtracking) and thereby supports the designer in design assessment over an entire design project The automatic recoverability of all necessary decision-and analysis data to restart a new design direction from an earlier design stage allows systematic design branching as well.

The Impact of Icons & Visual Effects on Learning Computer Databases

Improvements in computer graphics systems have made icons and visual effects available for use in designing database interfaces. However, little research has been reported about the impact of icons and visual effects on performance measures such as item selection time and recall of the databases. The present study examined the effect of icons and visual effects on item selection time and recall of a hierarchical database structure. Information in the database was represented by either a text label or a combined icon-text label. In addition, three types of visual effects during transition between menu screens were examined: instantaneous change, zoom open from the previous screen, and dissolve into the next screen. Both the item representation and screen transition manipulations were examined between subjects. Subjects were required to reach goals by selecting items from the various menus in the database. Processing time per menu screen and recall of the database were measured for each subject. Both the type of representation (icon-text vs. text alone) and the type of transition between menus (zoom, instantaneous change or dissolve) were found to affect subjects' ability to recall the structure of the database. Furthermore, no similar effects on item selection time were found for either manipulation. These results suggest that icons and visual effects can facilitate recall of hierarchical databases without increasing traversal time. In addition, the results suggest that indiscriminate use of some visual effects (dissolve) can impair learning of computer databases.