Relational Tables Research Articles

Browsing large online data tables using generalized query previews

Companies, government agencies, and other organizations are making their data available to the world over the Internet. They often use large online relational tables for this purpose. Users query such tables with front-ends that typically use menus or form fillin interfaces, but these interfaces rarely give users information about the contents and distribution of the data. Such a situation leads users to waste time and network/server resources posing queries that have zero- or mega-hit results. Generalized query previews enable efficient browsing of large online data tables by supplying data distribution information to users. The data distribution information provides continuous feedback about the size of the result set as the query is being formed. Our paper presents a new user interface architecture and discusses three controlled experiments (with 12, 16, and 48 participants). Our prototype systems provide flexible user interfaces for research and testing of the ideas. The user studies show that for exploratory querying tasks, generalized query previews can speed user performance for certain user domains and can reduce network/server load.

Electrostatic spray deposition (ESD) of polymeric powders on thermoplastic (PA66) substrate

This paper deals with a primerless electrostatic spray deposition process (ESD) for coating thermoplastic (PA66) substrates using epoxy–polyester, metallic epoxy–polyester, and epoxy powder paint. A novel and never before used pretreatment system, based on a low speed cold spray of fine copper powders, applied a thin conductive film on the plastic substrate, which made the ESD possible. The focus of first part of the paper is on analyzing the influence of both electrical and aerodynamic process parameters on ESD process. Differences in behavior of the powders used were evident. Design of experiments (DOE) was used to plan experimental trials and related ANOVA tables were made and used as support instruments to interpret the experimental findings, process modeling, and to the understand physical phenomena involved in the deposition process. As a result, several process maps were produced in which consistent trends of coating thickness and average roughness vs. operative parameters are reported. Careful qualification of the polymeric films was also carried out using the most relevant performance indicators. The second part of the paper focuses on assessing the influence of exposure time on coating thickness and average roughness of the polymeric films, that is, once the electrical and aerodynamic parameters had been optimized.

The role of transglutaminase-2 and its substrates in human diseases

The most characteristic enzymatic function of the class of enzymes known as transglutaminases (TG, EC 2.3.2.13) is the formation of covalent bonds between epsilon-amino groups of primary amines (from lysines or others) and the gamma-carboxamine group of glutamine residues of proteins. In the last years, a growing body of evidence indicate that the most interesting member of the TG family, namely the tissue TG (tTG, also called transglutaminase type 2, TG2), possesses more than one catalytic function. In fact, TG2 is able to catalyze a crosslinking reaction, a deamidation reaction and also shows GTP-binding/hydrolyzing and isopeptidase activities. Therefore, it can act on several classes of substrates, ranging from proteins to peptides, small reactive molecules like mono- and polyamines, and nucleotides. Given the broad spectrum of potentially different activities, elucidating the role of TG2 and its substrates in cellular functions and human diseases is a difficult task. In this study we focus our attention on substrates of TG2 and report a number of interesting considerations about their possible interplay in biological processes and involvement in human diseases, including genetic disorders. A significant improvement in understanding this complex scenario may come from a "multi-interfaced" approach, by exploiting different bioinformatic tools. Starting from a database of known TG2 substrates and using bioinformatic cross-search among other databases, we generated relational tables from which an involvement of TG2 in several genetic disorders can be hypothesized. Developing new bioinformatic tools and strategies to investigate the role of TG2 in molecular mechanisms underlying human diseases will add new light to this fascinating field of research.

Object-relational database design-exploiting object orientation at the database level

This paper applies the object-relational database paradigm in the design of a Health Management Information System. The class design, mapping of object classes to relational tables, the representation of inheritance hierarchies, and the appropriate database schema are all examined.Keywords: object relational, database schema, OID, instance variables, health systemGlobal Journal of Pure and Applied Sciences Vol. 11(4) 2005: 561-565

The Application of Management System ORDBMS Object Relational Data Base in System by Using ORACCL

This research implements the concept of Object Relational Data Base Management System (ORDBMS) on depreciation by converting it from relational application to object application without changing current relational application and dealing with its details by using Object Views. Object Views can be derived from the relational system and form a layer of object oriented program above the relational table. Thus ,it gives us new method for making queries on relational database and decreasing SQL sentences by using MAKE_REF instead of making complex relations between multiple tables so data is viewed as one unit. by using CAST_MULTISET multiple data can be implemented into object view without making multiple relational between collections. The application is programmed using Oracle8 because it has the propriety of object relational data base and also it provides INSTEAD OF trigger for inserting and manipulating data in the relational table by using object views.

Sedimentary cycles and facies architecture of aeolian–fluvial strata of the Upper Jurassic Guará Formation, southern Brazil

AbstractThe Upper Jurassic Guará Formation comprises an 80–200 m thick continental succession exposed in the western portion of the Rio Grande do Sul State (Brazil). It comprises four distinct facies associations: (i) simple to locally composite crescentic aeolian dune sets, (ii) aeolian sand sheets, (iii) distal floodflows, and (iv) fluvial channels. The vertical stacking of the facies associations defines several 5–14 m thick wetting‐upward cycles. Each cycle starts with aeolian dune sets followed by aeolian sand sheets deposits and culminating in either fluvial channels or distal flood strata. Within some cycles, aeolian sand sheets are absent and fluvial deposits rest directly above aeolian dune facies. The transitions from one facies association to another are abrupt and marked by erosive surfaces that delineate distinct episodes of sediment accumulation. The origin of both the wetting‐upward cycles and the erosive surfaces was controlled by the ground‐water table level, dry sand availability and aeolian and fluvial sediment transport capacity variations, related to climatic fluctuations between relatively arid and humid conditions. Preservation of the fluvial–aeolian deposits reflects an overall relative water table rise driven by subsidence.

Ontology management for large-scale enterprise systems

Semantic markup languages such as RDF (Resource Description Framework) [ Resource Description Framework (RDF), http://www.w3.org/RDF/] and OWL (Web Ontology Language) [ Web Ontology Language (OWL), http://www.w3.org/2004/OWL/] are increasingly being used to externalize meta-data or ontologies about data, software and services in a declarative form. Such externalized descriptions in ontological format are used for purposes ranging from search and retrieval to information integration and to service composition [Resource Description Framework (RDF): Projects and Applications, http://w3c.org/RDF/#projects, Web Ontology Language (OWL): Tools, Projects and Applications, http://w3c.org/2004/OWL/#projects]. Ontologies could significantly reduce the costs of deploying, integrating and maintaining enterprise systems. The barrier to more wide-spread use of ontologies for such applications is the lack of support in the currently available middleware stacks used in enterprise computing. This paper presents our work on developing an enterprise-scale ontology management system that will provide APIs and query languages, and scalability and performance that enterprise applications demand. We describe the design and implementation of the management system that programmatically supports the ontology needs of enterprise applications in a similar way a database management system supports the data needs of applications. In addition, we present a novel approach to representing ontologies in relational database tables to address the scalability and performance issues. The state of the art ontology management systems are either memory-based or use ad hoc solutions for persisting data, and so provide limited scalability.

경로정보의 중복을 제거한 XML 문서의 저장 및 질의처리 기법

본 논문에서는 대용량 XML 문서를 저장하고 그로부터 원하는 정보를 효율적으로 찾기 위한 방법으로, 경로정보의 중복을 제거하면서 역 인덱스를 함께 이용한 방법을 제안한다. XML 문서는 트리구조에 기반한 노드로 분해되어, 노드 타입에 따라, 루트에서 각 노드까지의 경로정보와 함께 관계형 테이블에 저장된다. 경로정보를 이용한 기존의 U 질의 기법들에서는 모든 엘리먼트 노드들에 대해 경로정보를 저장함에 따라 정보의 양이 증가하여 질의 처리의 성능을 저하시키는 요인이 되고 있다. 제안 방법에서는 경로정보 중 가장 긴 단말 엘리먼트 노드까지의 경로인 단말 엘리먼트 경로(leaf element path)만 저장하고 내부 엘리먼트 노드까지의 경로인 내부 엘리먼트 경로들(internal element paths)은 저장하지 않는다. 단말 엘리먼트 경로만을 대상으로 하여 역 인덱스를 구성함에 따라, 기존의 역 인덱스 이용 기법에 비해 키워드별 포스팅 리스트(posting lists)의 수를 줄이게 된다. 제안 방법에서는 U 문서의 저장과 질의를 위하여 XML 문서에 대한 스키마 정보가 없어도 되며, 관계형 데이터베이스의 어떤 확장도 요구하지 않는다. 실험을 통해 제안 방법은 실험 범위 내에서 기존 기법들에 비해 좋은 성능을 보인다. This Paper Proposes an approach that removes the redundancy of Path information and uses an inverted index, as an efficient way to store a large volume of XML documents and to retrieve wanted information from there. An XML document is decomposed into nodes based on its tree structure, and stored in relational tables according to the node type, with path information from the root to each node. The existing methods using path information store data for all element paths, which cause retrieval performance to be decreased with increased data volume. Our approach stores only data for leaf element path excluding internal element paths. As the inverted index is made by the leaf element path only, the number of posting lists by key words become smaller than those of the existing methods. For the storage and retrieval of U data, our approach doesn't require the XML schema information of XML documents and any extension of relational database. We demonstrate the better performance of on approach than the existing approaches within the scope of our experiment.

Mining generalized knowledge from ordered data through attribute-oriented induction techniques

The attribute-oriented induction (AOI for short) method is one of the most important data mining methods. The input of the AOI method contains a relational table and a concept tree (concept hierarchy) for each attribute, and the output is a small relation summarizing the general characteristics of the task-relevant data. Although AOI is very useful for inducing general characteristics, it has the limitation that it can only be applied to relational data, where there is no order among the data items. If the data are ordered, the existing AOI methods are unable to find the generalized knowledge. In view of this weakness, this paper proposes a dynamic programming algorithm, based on AOI techniques, to find generalized knowledge from an ordered list of data. By using the algorithm, we can discover a sequence of K generalized tuples describing the general characteristics of different segments of data along the list, where K is a parameter specified by users.

An XML-Based Approach to Publishing and Querying the History of Databases

There is much current interest in publishing and viewing databases as XML documents. The general benefits of this approach follow from the popularity of XML and the tool set available for visualizing and processing information encoded in this universal standard. In this paper, we explore the additional and unique benefits achieved by this approach on temporal database applications. We show that XML with XQuery can provide surprisingly effective solutions to the problem of supporting historical queries on past content of database relations and their evolution. Indeed, using XML, the histories of database relations can be naturally represented by temporally grouped data models. Thus, we identify mappings from relations to XML that are most conducive to modeling and querying database histories, and show that temporal queries that would be difficult to express in SQL can be easily expressed in standard XQuery. This approach is very general, insofar as it can be used to store the version history of arbitrary documents and, for relational databases, it also supports queries on the evolution of their schema. Then, we turn to the problem of supporting efficiently the storage and the querying of relational table histories. We present an experimental study of the pros and cons of using native XML databases, versus using traditional databases, where the XML-represented histories are supported as views on the historical tables.

Efficient evaluation of linear path expressions on large-scale heterogeneous XML documents using information retrieval techniques

We propose XIR-Linear, a method for efficiently evaluating linear path expressions (LPEs) on large-scale heterogeneous XML documents using information retrieval (IR) techniques. LPEs are the primary form of XPath queries, and their evaluation techniques have been researched actively. XPath queries in their general form are partial match queries, and these queries are particularly useful for searching documents of heterogeneous schemas. Thus, XIR-Linear is geared for partial match queries expressed as LPEs. XIR-Linear has its basis on existing methods using relational tables (e.g., XRel, XParent), and drastically improves their efficiency using the inverted index technique. Specifically, it indexes the labels in label paths (i.e., sequences of node labels) like keywords in texts, and finds the label paths matching the LPE far more efficiently than string match used in the existing methods. We demonstrate the efficiency of XIR-Linear by comparing it with XRel and XParent using XML documents crawled from the Internet. The results show that XIR-Linear outperforms XRel and XParent by an order of magnitude with the performance gap widening as database size grows.

Demand-driven frequent itemset mining using pattern structures

Frequent itemset mining aims at discovering patterns the supports of which are beyond a given threshold. In many applications, including network event management systems, which motivated this work, patterns are composed of items each described by a subset of attributes of a relational table. As it involves an exponential mining space, the efficient implementation of user preferences and mining constraints becomes the first priority for a mining algorithm. User preferences and mining constraints are often expressed using patterns’ attribute structures. Unlike traditional methods that mine all frequent patterns indiscriminately, we regard frequent itemset mining as a two-step process: the mining of the pattern structures and the mining of patterns within each pattern structure. In this paper, we present a novel architecture that uses pattern structures to organize the mining space. In comparison with the previous techniques, the advantage of our approach is two-fold: (i) by exploiting the interrelationships among pattern structures, execution times for mining can be reduced significantly; and (ii) more importantly, it enables us to incorporate high-level simple user preferences and mining constraints into the mining process efficiently. These advantages are demonstrated by our experiments using both synthetic and real-life datasets.

BatchFlow

In a typical IT division of a large enterprise, there are a significant number of batch jobs that process data in relational database systems and flat files. These jobs may range from those that are run once in a year to those that are run every hour or every few minutes. While there are many notations available to represent a relational database schema including the ER model [1], it appears that there is no good visual notation to represent the jobs themselves. To some extent, this problem can be addressed by using flowcharts, UML sequence diagrams, and operations summary matrix. However, these notations and representations do not leverage the fact that most of the operations in a batch job are usually a relational select/insert/update/delete operation on a relational table, or a read/write operation on a file. In this paper, we introduce a method and notation that we call BatchFlow. This notation can help organizations in visualizing and communicating the batch job designs at a high level.

Selective Replication for Content Management Environments

Content management applications typically depend on information stored in both relational database tables and operating system files. Often, content providers replicate all or parts of the available database data and associated files to increase application availability, address resource constraints and costs, or better support geographically dispersed and mobile users. This article presents a solution that addresses integrated and selective database and file replication in the context of an enterprise voice portal. The solution is transparent to existing applications and imposes minimal storage overhead.

Attribute Clustering for Grouping, Selection, and Classification of Gene Expression Data

This paper presents an attribute clustering method which is able to group genes based on their interdependence so as to mine meaningful patterns from the gene expression data. It can be used for gene grouping, selection, and classification. The partitioning of a relational table into attribute subgroups allows a small number of attributes within or across the groups to be selected for analysis. By clustering attributes, the search dimension of a data mining algorithm is reduced. The reduction of search dimension is especially important to data mining in gene expression data because such data typically consist of a huge number of genes (attributes) and a small number of gene expression profiles (tuples). Most data mining algorithms are typically developed and optimized to scale to the number of tuples instead of the number of attributes. The situation becomes even worse when the number of attributes overwhelms the number of tuples, in which case, the likelihood of reporting patterns that are actually irrelevant due to chances becomes rather high. It is for the aforementioned reasons that gene grouping and selection are important preprocessing steps for many data mining algorithms to be effective when applied to gene expression data. This paper defines the problem of attribute clustering and introduces a methodology to solving it. Our proposed method groups interdependent attributes into clusters by optimizing a criterion function derived from an information measure that reflects the interdependence between attributes. By applying our algorithm to gene expression data, meaningful clusters of genes are discovered. The grouping of genes based on attribute interdependence within group helps to capture different aspects of gene association patterns in each group. Significant genes selected from each group then contain useful information for gene expression classification and identification. To evaluate the performance of the proposed approach, we applied it to two well-known gene expression data sets and compared our results with those obtained by other methods. Our experiments show that the proposed method is able to find the meaningful clusters of genes. By selecting a subset of genes which have high multiple-interdependence with others within clusters, significant classification information can be obtained. Thus, a small pool of selected genes can be used to build classifiers with very high classification rate. From the pool, gene expressions of different categories can be identified.

Storing and querying XML data using denormalized relational databases

XML database systems emerge as a result of the acceptance of the XML data model. Recent works have followed the promising approach of building XML database management systems on underlying RDBMS’s. Achieving query processing performance reduces to two questions: (i) How should the XML data be decomposed into data that are stored in the RDBMS? (ii) How should the XML query be translated into an efficient plan that sends one or more SQL queries to the underlying RDBMS and combines the data into the XML result? We provide a formal framework for XML Schema-driven decompositions, which encompasses the decompositions proposed in prior work and extends them with decompositions that employ denormalized tables and binary-coded XML fragments. We provide corresponding query processing algorithms that translate the XML query conditions into conditions on the relational tables and assemble the decomposed data into the XML query result. Our key performance focus is the response time for delivering the first results of a query. The most effective of the described decompositions have been implemented in XCacheDB, an XML DBMS built on top of a commercial RDBMS, which serves as our experimental basis. We present experiments and analysis that point to a class of decompositions, called inlined decompositions, that improve query performance for full results and first results, without significant increase in the size of the database.

Recording relative water table depth using PVC tape discolouration: Advantages and constraints in fens

AbstractQuestion: Recognizing water table dynamics in wetlands is crucial for understanding species‐environment relationships, ecosystem function and changes during restoration. The PVC tape discolouration method enables spatially and temporally extensive studies of reductive conditions associated with long‐term water table dynamics in peat soils. The reliability of the method has been verified only for ombrotrophic bogs, even though wide usage can be expected in minerotrophic fens.Location: Třreboň basin, Czech Republic.Methods: Using data from 49 plots in six poor and moderately rich fens, we correlated the directly measured lowest, highest and mean water table depths and the same variables indicated by discolouration of PVC tape attached to green bamboo stakes installed vertically in the soil profile.Results: The depth to the first sign of PVC discolouration was highly correlated with the directly measured position of the highest water table, the correlation between the depth of complete discolouration and the directly measured position of the lowest water table was poorer. The accuracy of the minimum water table measurement depended on the depth of the peat layer. Surprisingly, the depth at which the green bamboo stakes turned brown correlated highly with the minimum water table.Conclusions: The PVC tape discolouration method reliably indicates water table maxima in fens, but minima are not accurately indicated. The depth of the green bamboo discolouration is suggested as a new alternative indicator of the minimum water table, even in fens and mineral soils. Combining both methods enables efficient monitoring of water table dynamics at a large number of mire sites.

Fast rendering of dynamic clouds

We propose an efficient framework for dynamic cloud rendering. Based on the proposed simplified lighting model, the shadow relation table and metaball lighting texture database are constructed in the preprocessing, and features such as self-shadowing and light scattering can be computed quickly using table lookup at the run time. Clouds are rendered using textured billboards and alpha blending, which is further speeded up by incorporating the octree hierarchy and the hierarchical texture caching.

Preliminary study of landslide risk evaluation by micro landform interpretation on southern slope of Siwalik Hills, Nepal, using aerial photo interpretation

Landslide induced disaster is a serious problem in the mountainous terrain of Nepal. The landslides and debris flows cause losses of lives and properties, damage the nature and other infrastructures in the monsoon every year. The risk evaluation of landslides is to be most important for landslide hazard reduction . This paper is to focus on evaluating the potential landslide topography of Shrawan danda landslide which lies on the southern slopes of the Siwalik Hills and has created serious problems in Butwal, Nepal. The series of the investigation methods have been carried out to identify the characteristic of each factor of the micro landform of the landslide through interpretation of aerial photographs incorporated with the information of field survey and historical records. The maps and related tables were converted to digital format from the database that was the part of the geographical information system (GIS). The information of aerial photo interpretation has been used for risk evaluation of the landslide based on the AHP method.Firstly, Shrawan danda landslide was divided into three landside bodies (A, B and C) based on the geomorphological features of the landslide area. Secondly the distribution maps of the micro landform features were prepared by using GIS. Thirdly, the length, area and density of the micro landform features (scarps, blocks, bare lands and cracks) of the landslide bodies were calculated. After that, the detailed information of instability of the landform features of the landslide bodies were analyzed for risk evaluation. Finally the weight of risk value of the micro landform features produced by the AHP method were used for classifying the landslide bodies as one with high, moderate or low risk.The results show the weight of risk value of the landslide body A=44, B=90.4, and C=76.4 points. The weight of risk value of the landslide body B and C were found more than 70%. These landslide bodies are highly contributed by the number, length and density of the micro landform features which are perceived as high risk . The weight of risk value of the landslide body A was found between 30 to 70% which is moderately controlled by the number, length, area and density of the micro landform features that is perceived as moderate risk. Thus results of qualitative and quantitative estimation of the micro-landform features led by using GIS and numerical function, and the weight of the risk value of the micro landform features led by using Analytical Hierarchy Process (AHP) method synthesizing information of the aerial photo interpretation (API) provide a precise contribution to evaluate risk of a landslide in various environmental conditions.

Recording relative water table depth using PVC tape discolouration: Advantages and constraints in fens

Abstract Question: Recognizing water table dynamics in wetlands is crucial for understanding species-environment relationships, ecosystem function and changes during restoration. The PVC tape discolouration method enables spatially and temporally extensive studies of reductive conditions associated with long-term water table dynamics in peat soils. The reliability of the method has been verified only for ombrotrophic bogs, even though wide usage can be expected in minerotrophic fens. Location: Třeboň basin, Czech Republic. Methods: Using data from 49 plots in six poor and moderately rich fens, we correlated the directly measured lowest, highest and mean water table depths and the same variables indicated by discolouration of PVC tape attached to green bamboo stakes installed vertically in the soil profile. Results: The depth to the first sign of PVC discolouration was highly correlated with the directly measured position of the highest water table, the correlation between the depth of complete discolourat...