Data access

About: Data access is a research topic. Over the lifetime, 13141 publications have been published within this topic receiving 172859 citations. The topic is also known as: Data access.

Table driven graphical user interface

Abstract: A Graphical User Interface (GUI) is provided for workstations on a network in which a complex operation is controlled. At least one node on the network has a Desktop Management Interface (DMI) with an object oriented database for storing data objects for the complex operation. Objects are organized according to the DMI into components, groups and attributes. The GUI is generic to any complex operation but requires the DMI for access to data. The GUI enables the user to manage information in the database in whatever manner the user has interest through the provision of report definitions through which specific component, group, and attribute data are obtained in accordance with row and column definitions for table display. The DMI interface is probed with appropriate commands generated by the GUI to obtain and display the requested data. Provision is made for displaying data in chart format and a chain feature is provided to move from one report to another. Various other features are provided.

VDB: High-resolution sparse volumes with dynamic topology

Abstract: We have developed a novel hierarchical data structure for the efficient representation of sparse, time-varying volumetric data discretized on a 3D grid. Our “VDB”, so named because it is a Volumetric, Dynamic grid that shares several characteristics with Bptrees, exploits spatial coherency of time-varying data to separately and compactly encode data values and grid topology. VDB models a virtually infinite 3D index space that allows for cache-coherent and fast data access into sparse volumes of high resolution. It imposes no topology restrictions on the sparsity of the volumetric data, and it supports fast (average O(1)) random access patterns when the data are inserted, retrieved, or deleted. This is in contrast to most existing sparse volumetric data structures, which assume either static or manifold topology and require specific data access patterns to compensate for slow random access. Since the VDB data structure is fundamentally hierarchical, it also facilitates adaptive grid sampling, and the inherent acceleration structure leads to fast algorithms that are well-suited for simulations. As such, VDB has proven useful for several applications that call for large, sparse, animated volumes, for example, level set dynamics and cloud modeling. In this article, we showcase some of these algorithms and compare VDB with existing, state-of-the-art data structures.

Making views self-maintainable for data warehousing

Abstract: A data warehouse stores materialized views over data from one or more sources in order to provide fast access to the integrated data, regardless of the availability of the data sources. Warehouse views need to be maintained in response to changes to the base data in the sources. Except for very simple views, maintaining a warehouse view requires access to data that is not available in the view itself. Hence, to maintain the view, one either has to query the data sources or store auxiliary data in the warehouse. The authors show that by using key and referential integrity constraints, one often can maintain a select-project-join view without going to the data sources or replicating the base relations in their entirety in the warehouse. They derive a set of auxiliary views such that the warehouse view and the auxiliary views together are self-maintainable-they can be maintained without going to the data sources or replicating all base data. In addition, their technique can be applied to simplify traditional materialized view maintenance by exploiting key and referential integrity constraints.

System and method for location based web services

Abstract: In one embodiment of the invention there is provided a system and method whereby a local application (1-3) may interface with a single API (1-3) and be automatically connected to the appropriate source of terminal location information. In another embodiment of the invention there is provided a system and method whereby a remote application (1-3) and/or web service may interface with a single API (1-3) and be automatically connected to the appropriate source of terminal location information. In another embodiment of the invention there is provided a system and method whereby a user can specify his privacy preferences to one database and be assured that his preferences would be adhered to by all location providing sources, thereby allowing the user to exact direct control over which applications (1-1) and web services have access to data concerning the location of his mobile.

Ontology-based data access: a survey

Abstract: We present the framework of ontology-based data access, a semantic paradigm for providing a convenient and user-friendly access to data repositories, which has been actively developed and studied in the past decade. Focusing on relational data sources, we discuss the main ingredients of ontology-based data access, key theoretical results, techniques, applications and future challenges.