Abstract: A method, system and article of manufacture for accessing data in a database independent of the particular manner in which the data is physically represented and for providing an abstract representation of the data in the database. One embodiment provides a method of architecting a logical representation of physical data in a database comprising providing a template data abstraction model defining template logical fields, and providing, on the basis of the template data abstraction model, a logical representation of the physical data, the logical representation defining a plurality of logical fields providing an abstract view of the physical data and adapted for transforming logical fields of abstract queries into a form consistent with the physical data in the database.

Abstract: BACKGROUND: The complexity and the rapid evolution and expansion of the domain of clinical information make development and maintenance of clinical databases difficult. Whenever new data types are introduced or existing types are modified in a conventional relational database system, the physical design of the database must be changed accordingly. For this reason, it is desirable that a clinical database be flexible and allow for modifications and for addition of new types of data without having to change the physical database schema. The ideal clinical database would therefore implement a highly-detailed logical database schema in a completely-generic physical schema that stores the wide variety of clinical data in a small and constant number of tables. OBJECTIVE: The objective was to review the medical literature regarding generic design of clinical databases. METHODS: A search strategy was devised for PubMed and Google to get the best match of peer-reviewed articles and free Web resources on the subject. RESULTS: Eight peer reviewed articles and a Web tutorial were found. All the resources described the so-called Entity-Attribute-Value (EAV) design as a means of simplifying the physical layout of data tables in a clinical database. In Entity-Attribute-Value design all data can be stored in a single generic table with conceptually 3 columns: 1 for entity (eg, patient identification), 1 for attribute (eg, name), and 1 for value (eg, "Jens Hansen"). To add more descriptive fields to the entity class, all that is necessary is to add attribute values to be stored in the attribute field. The main advantages of the Entity-Attribute-Value design are flexibility and effective entity-centered data retrieval. The main disadvantages are complicated front-end programming needed to display data in a conventional layout that the user understands and less-efficient attribute-centered queries. The Internet offers unique opportunities for database deployment, eliminating problems of user-interface deployment. Furthermore, Web forms may be generated in a completely-generic fashion during run time from metadata describing the semantic structure of clinical information stored in the database. CONCLUSIONS: The Entity-Attribute-Value model is useful for generic design of clinical databases. Depending on the specific requirements of the application, more or less complex metadata models may be applied. [J Med Internet Res 2003;5(4):e27]

Abstract: A method, system and article of manufacture for accessing data in a database independent of the particular manner in which the data is physically represented and for modeling a physical representation of the data in the database for architecting a relationship between the physical representation of the data in the database and a logical representation of the data. One embodiment provides a method for architecting a relationship between a physical representation of data in a database and a logical representation of the data. The method comprises providing the logical representation defining logical fields; and then providing, on the basis of the logical representation, the physical representation for the data, whereby the logical fields defined by the logical representation provide an abstract view of the data and map logical fields of abstract queries to respective data in the database.

Abstract: Increasingly, for extensibility and performance, special purpose application code is being integrated with database system code. Such application code has direct access to database system buffers, and as a result, the danger of data being corrupted due to inadvertent application writes is increased. Previously proposed hardware techniques to protect from corruption require system calls, and their performance depends on details of the hardware architecture. We investigate an alternative approach which uses codewords associated with regions of data to detect corruption and to prevent corrupted data from being used by subsequent transactions. We develop several such techniques which vary in the level of protection, space overhead, performance, and impact on concurrency. These techniques are implemented in the Dali main-memory storage manager, and the performance impact of each on normal processing is evaluated. Novel techniques are developed to recover when a transaction has read corrupted data caused by a bad write and gone on to write other data in the database. These techniques use limited and relatively low-cost logging of transaction reads to trace the corruption and may also prove useful when resolving problems caused by incorrect data entry and other logical errors.

Abstract: Whereas physical database tuning has received a lot of attention over the last decade, logical database tuning seems to be under-studied We have developed a project called DBA Companion devoted to the understanding of logical database constraints from which logical database tuning can be achievedIn this setting, two main data mining issues need to be addressed: the first one is the design of efficient algorithms for functional dependencies and inclusion dependencies inference and the second one is about the interestingness of the discovered knowledge In this paper, we point out some relationships between database analysis and data mining In this setting, we sketch the underlying themes of our approach Some database applications that could benefit from our project are also described, including logical database tuning

Abstract: A three-dimensional (3D) volumetric geo-spatial querying system. The system can include a 3D GIS. The 3D GIS can include a database of geo-spatial data (130) configured to store geo-spatial data using, not two-dimensional, but three-dimensional coordinates. The GIS further can include at least one database operation configured to process a database query (150) against geo-spatial data stored in the database. Notably, the database operation can accept three-dimensional coordinates as part of the database query. Importantly, the 3D GIS can include a geo-spatial data encoder configured to encode the geo-spatial data prior to storing the geo-spatial data in the database. In particular, in one aspect of the present invention, the encoder can be a helical hyperspatial code encoder, or an oct-tree encoder.

Abstract: A conceptual model for environmental data is presented with special emphasis on the ability to store spatio-temporal references of the data. Other aspects of the model are the ability to handle hierarchical data and semantics of the measurements. The model was tested with an implementation on an object-relational database management system. As a part of the test implementation, a forestry data set covering 75 years and 4900 hectares was loaded onto the database.

Abstract: In this paper an integrated geographic expert database system is presented which takes advantage of the relational database methodology combined with a geographic information system (GIS) and an expert system (ES). The GIS illustrates the data that are stored in the database after collaboration with the embedded ES. The system is fully implemented and applied to an interesting problem in apiculture.

Abstract: A tool for estimating performance of a data storage system includes a database containing performance data for a plurality of possible data storage system configurations; and a computer or processor for receiving user input defining a data storage system configuration, retrieving recorded performance data corresponding to the data storage system configuration from the database, and calculating estimated performance data for the data storage system configuration based on the data from the database.

Abstract: Nowadays, the vast volume of collected digital data obliges us to employ processing methods like pattern recognition and data mining in order to reduce the complexity of data management. The output of these techniques are knowledge artifacts, heterogeneous in both structure and semantics. We claim that the concept of pattern is a good candidate for generic representation of these novel information types. The PANDA project is aimed at studying the main issues related to pattern handling. In this paper we present the preliminary results obtained: we outline the architecture of Pattern-Base Management Systems, we provide the foundations of the logical framework, and we present the preliminary issues related to processing queries on patterns.

Abstract: Parallel database systems are being used nowadays in a wide variety of systems, right from database applications to decision support systems. These implementations involve database processing and querying over parallel systems. For the parallel databases to be effective and efficient, various optimizing solutions need to be implemented. These solutions deal with various issues associated with such database systems : query optimization, data allocation within the database, etc.This paper will attempt to give the reader an understanding of the various issues involved in optimizing the performance of a parallel database system. The primary areas of focus will be system architecture, query optimization and data reallocation. It will look at related work done by other authors in this field and hopefully provide a thorough understanding of the solutions in this area.

Abstract: A database operation mechanism includes the capability of specifying a predefined database operation as a source of data for a different database operation. When the different database operation needs to be performed, the database operation mechanism determines whether the different database operation can use a predefined database operation as a data source. If so, the predefined database operation is specified as the source of data for the different database operation. If the different database operation cannot use a predefined database operation as a data source, the database operation mechanism determines whether the different database operation can use a modified form of a predefined database operation as a data source. If so, the different database operation may use the modified predefined database operation as a source of data. If the different database operation cannot use a predefined database operation or a modified form of a predefined database operation as a data source, a different database operation is generated and executed.

Abstract: A method, system and article of manufacture for accessing data in a database independent of the particular manner in which the data is physically represented and for preventing alterations of data in the database when a query is executed against the database are provided. One embodiment provides a method of preventing alterations of data in a database when a query is executed against the database. The method comprises providing a logical representation of the data defining a plurality of logical fields abstractly describing associated physical entities of the data; receiving an abstract query comprising at least one logical field of the plurality of logical fields; and locking the at least one logical field before executing the abstract query.

Abstract: At present, the construction of National Spatial Data Infrastructure (NSDI) and Digital Earth imminently needs efficient management of multi-scale and multi-resource mass image data. This paper gives systematic and deep researches on distributed heterogeneous management mode of super-image\|project and image-project based on commercial database management system (such as ORACLE, SQL Server) and Component Object Modal (COM) after the characteristics of image data and its management requirement is comprehensively analyzed. The design and implementation method for large-scale seamless image database management system is also described.

Abstract: A database administrator (DBA) must make many decisions about what is the best decision for a database and its users - including what is the best physical DB design decision. The DBA must determine what auxiliary data structures to create - such as indexes and materialized views - as well as the optimal way to partition each table in a shared-nothing partitioned system, to maximize workload performance while minimizing any increase in disk space or maintenance costs. Given the number of possible configurations, the possible interactions between each choice, and the associated constraints on the decision, the problem of selecting an optimal design is daunting for even the most skilled DBA. It has long been recognized that DBAs need tools to help them make these complex decisions, but until recently little progress was made. We present our vision for the future of automating physical DB design, and contrast it with previous attempts at solving this problem.

Abstract: The cadastral data in Turkey form a large spatial dataset and require efficient data management tools. A fruitful and effective database should be designed and developed therefore to manage cadastral data. The database to be developed should be modeled using a spatial and temporal modeling technique. This study describes the design and implementation of a cadastral database with a spatiotemporal modeling approach in Turkey. The objectives are to propose a design of a spatiotemporal database that fulfills the requirements for spatial, temporal, and spatiotemporal queries for cadastral data, to implement the proposed design in a study area, and to enforce the development of multipurpose-motivated cadastral data. In order to meet the study objectives, the required characteristics of a cadastral database were taken into consideration while performing the design. The phases followed during database design process include the requirements collection and analysis, the conceptual design, the choice of a database, the logical design, the physical design, and the implementation of the database system. The proposed design was implemented in Cayyolu quarter of Ankara. Oracle 8i Spatial was chosen as the Database Management System since it provides the storage and the management of spatial data in an object-relational structure. MapInfo 6.0 GIS software was used to display, manipulate, and query the cadastral data.

Abstract: Many steps are involved in the process of turning an initial concept for a database into a finished product that meets the needs of its user community. In this paper, we describe those steps in the context of a four-phase process with particular emphasis on the quality-related issues that need to be addressed in each phase to ensure that the final product is a high quality database. The basic requirements for a successful database quality process are presented with specific examples drawn from experience gained in the Standard Reference Data Program at the National Institute of Standards and Technology.

Abstract: A method of retrieving and viewing data from a database includes the steps of receiving an input search strategy from a user and querying the database to determine the amount of data which will be returned by the search strategy. If the amount of data will exceeds the capacity of the software used for viewing said data. Then an external data file containing the viewable data is created. The external data file may be a cube file. The instant invention may comprise spreadsheet objects (36), as well as manipulation of datasets (10), tables (12), fields (14), pivot tables (16), and sql objects (18), resulting in a report (20).

Abstract: On the base of project about the construction of national resources and environment database and data-share, soil metadata,standard, and soil classification coding system of spatial database were discussed. Some suggestions about the construction of spatial database and selection of representative profile related, design of attribute database, standard and criterion of data, and scan precision and operational coefficients of spatial database were proposed.

Abstract: The Geophysical Data Base - Variable resolution (GDBV) is a modern, object-oriented data store that is designed to accommodate the dynamically derived parameters of the Geo-Acoustic Inversion Toolkit (GAIT). Sponsored by the Oceanographer of the Navy (CNO NO96) via PEO (C4I and Space) PMW-155, GAIT/GDBV is a Through-the-Sensor (TTS) program that includes a flexible data model for the assimilation of data at local, regional, and global levels of operation. In addition to its dynamic capabilities, GDBV also includes support for historical database roles similar to the Naval Oceanographic Office's (NAVOCEANO) Low Frequency Bottom Loss (LFBL) database. In order to demonstrate its highly extendable design, this paper explores GDBV's database format and data model. In both the historical and dynamic capacity, GDBV must be capable of evolving with new system specifications. GDBV's multiple levels of organization and object-oriented implementation provide an efficient solution for these requirements. In addition to its dynamic operational requirements, the GDBV database will accommodate the parameter definitions from each of the following Oceanographic and Atmospheric Master Library (OAML) databases: High Frequency Bottom Loss (HFBL), LFBL, MIW Sediments and Roughness, LFBL's N-Layer dataset, and the Applied Physics Laboratory of the University of Washington's (APL-UW) GeoAcoustic Bottom Interaction Model (GABIM) Bottom Back Scatter (BBS) database. Support for these static databases enables the future evolution of each individual database into a single broad database that provides a complete description of the ocean bottom. The complete parameter set of GDBV is presented along with a physical representation of the parameters. The overall data flow is very similar to a preceding TTS system, PUMA-TEDS. This working example of GDBV in GAIT reinforces the portability of the database design and the benefits of generic TTS software design. GDBV is a modern database that provides a lightweight, highly portable data store with sophisticated features traditionally offered in large scale database management systems. In addition to fulfilling the requirements of the expanding GAIT algorithms, the generic implementation of GDBV will provide a valuable tool for a wide range of environmental data types, including those of future TTS programs.

Abstract: The present invention is a method, system and apparatus for generating parameterized installation scripts to accommodate the installation of multiple databases sharing similar physical constructs. The method of the invention can include the step of creating a database which can achieve the foregoing stated advantages of the present invention, a parameterized description of a physical data model can be first combined with a set of database specific properties to produce a physical database. A parameterized description of a logical data model can be second combined with the set of database specific properties to generate a logical model for the physical database. The first combining step can include the step of creating at least one bufferpool in the physical database as specified by the properties. Also, the first combining step can include the step of creating at least one tablespace in the physical database as specified by the properties.

Abstract: In this paper we present a first distributed REal-time COsmic Ray Database (RECORD). The aim of the project is to develop a unified database with data from different neutron monitors collected together, in unified format and to provide a user with several commonly used data access methods. The database contains not only original cosmic ray data but also auxiliary data necessary for scientific data analysis. Currently the database includes Lomn.Stit, Moscow, Oulu; Tixie Bay, Yakutsk stations. The main database server is located in IKFIA SB RAS (Yakutsk) but there will be several mirrors of the database. The database and all its mirrors are updated on the nearly real-time (1 hour) basis. The data access software includes WWW-interface, Perl scripts and C library, which may be linked to a user program. Most of frequently used functions are implemented to make it operable to users without SQL language knowledge. A draft of the data representation standard is suggested, based on common practice of neutron monitor community. The database engine is freely distributed open-sourced PostgreSQL server coupled with a set of replication tools developed at Bioengineering division of the IRCCS E.Medea, Italy.

Abstract: : The New Jersey Water-Transfer Data System (NJWaTr) is a database design for the storage and retrieval of water-use data. NJWaTr can manage data encompassing many facets of water use, including (1) the tracking of various types of water-use activities (withdrawals, returns, transfers, distributions, consumptive- use, wastewater collection, and treatment); (2) the storage of descriptions, classifications and locations of places and organizations involved in water-use activities; (3) the storage of details about measured or estimated volumes of water associated with water-use activities; and (4) the storage of information about data sources and water resources associated with water use. In NJWaTr, each water transfer occurs unidirectionally between two site objects, and the sites and conveyances form a water network. The core entities in the NJWaTr model are site, conveyance, transfer/volume, location, and owner. Other important entities include water resource (used for withdrawals and returns), data source, permit, and alias. Multiple water-exchange estimates based on different methods or data sources can be stored for individual transfers. Storage of user-defined details is accommodated for several of the main entities. Many tables contain classification terms to facilitate the detailed description of data items and can be used for routine or custom data summarization. NJWaTr accommodates single-user and aggregate-user water-use data, can be used for large or small water-network projects, and is available as a stand-alone Microsoft Access database. Data stored in the NJWaTr structure can be retrieved in user-defined combinations to serve visualization and analytical applications. Users can customize and extend the database, link it to other databases, or implement the design in other relational database applications.

Abstract: The present invention provides a database system capable of dealing with dynamic changes in an event that vary continuously with time. A database system outputs a retrieval output from data in response to a user's retrieval request on the basis of a retrieval logic. The retrieval logic is allowed to evolve on the basis of a logical model. This logical model establishes a general relationship which leads results from conditions relating to a group of events that are dealt by a data group. Moreover, a database system optimizes a data structure on the basis of the logical model. The logical model can be transferred in a separated manner from the specific data contents of the data group. Therefore, the logical model can be exported to another database system of the same kind, and also imported from another data base system of the same kind.

Abstract: In this paper, we describe some of the issues faced when designing a database systems course that will be a compulsory component for second year undergraduates in computer science. The main goal is to give an overview of database systems starting from Codd’s classical paper through to practical implementation using a SQL server (MySQL) For conceptual modelling, we chose UML because of the prior knowledge of the target class. The logical model is derived from the conceptual model and we place great importance those features that preserve the integrity of the database. SQL is used to define the tables that MySQL can implement. We show how simple application programs are produced using JDBC.

Abstract: This paper reports on the application of the integration of mathematical programming model and database in a decision support system (DSS) for the planning of the multi-reservoir operating system. The DSS is based on a multi-objective, mixed-integer goal programming (MIGP) model, which can generate efficient solutions via the weighted-sums method (WSM). The major concern of this study is seamless, efficient integration between the mathematical model and the database, because there are significant differences in structure and content between the data for a mathematical model and the data for a conventional database application. In order to load the external optimization results on the database, we developed a systematic way of naming variable/constraint so that a rapid identification of variables/constraints is possible. An efficient database structure for planning of the multi-reservoir operating system is presented by taking advantage of the naming convention of the variable/constraint.

Abstract: In a Connected Society, the importance of database privacy and security increases considerably. Security must be considered as a fundamental requirement in Information Systems (IS) development, and has to be taken into consideration at all stages of the development, instead of being an isolated and marginal requirement considered once the IS is already finished. We propose a methodology for designing secure databases, which allows to design secure databases taking into account constraints regarding sensitive information from the requirements phase.

Abstract: The Teton Whitewater Kayak case is designed to provide students with a challenging hands-on exercise in relational database design. It is extensive enough to provide a stimulating exercise, but not so large as to be overwhelming. This case can be utilized for a group project in a database management or database design course. The case is sufficiently detailed to challenge students as they apply the design concepts explained in class to a problem that closely simulates a real-world problem. An associated project can be broken into deliverables, or individual components that cover a single task, to make the project more manageable. Some of the suggested deliverables associated with this project include the design of entityrelationship diagrams, normalization of the database schema, table creation, SQL query design, form and report design, and stored procedure and trigger design. The problem was designed to be extensible. For example, while it does into include credit card processing or selling equipment on consignment, those features can be easily added to make the case more complex. The case can even be extended for use in an analysis and design class, as the services provided by the company are presented as a set of processes that can be easily represented in a data flow diagram.

Abstract: A system and method for batch-feeding existing data that is formatted for one type of software application to another type of software application. The steps to provide the existing data to another type of software application include assembling the data into one-to-one tables, providing the one-to-one tables to a server, receiving the one-to-one tables at the server, reformatting the data from the one-to-one tables to a reformatted form according to rules of the software application, and entering the data in the reformatted form in a database. The system allows a user to save the existing data in the one-to-one tables on a share drive that is also accessible to a server. The user is then able to initiate the reformatting of the data by emailing the server a request to reformat the data.