Results 1 - 10 of 19,880

Access path selection in a relational database management system

by P. Griffiths Selinger, M. M. Astrahan, D. D. Chamberlin, It. A. Lorie, T. G. Price , 1979
"... ABSTRACT: In a high level query and data manipulation language such as SQL, requests are stated non-procedurally, without reference to access paths. This paper describes how System R chooses access paths for both simple (single relation) and complex queries (such as joins), given a user specificatio ..."
Abstract - Cited by 587 (1 self) - Add to MetaCart
ABSTRACT: In a high level query and data manipulation language such as SQL, requests are stated non-procedurally, without reference to access paths. This paper describes how System R chooses access paths for both simple (single relation) and complex queries (such as joins), given a user

Multidimensional Access Methods

by Volker Gaede, Oliver Günther , 1998
"... Search operations in databases require special support at the physical level. This is true for conventional databases as well as spatial databases, where typical search operations include the point query (find all objects that contain a given search point) and the region query (find all objects that ..."
Abstract - Cited by 686 (3 self) - Add to MetaCart
Search operations in databases require special support at the physical level. This is true for conventional databases as well as spatial databases, where typical search operations include the point query (find all objects that contain a given search point) and the region query (find all objects

Query evaluation techniques for large databases

by Goetz Graefe - ACM COMPUTING SURVEYS , 1993
"... Database management systems will continue to manage large data volumes. Thus, efficient algorithms for accessing and manipulating large sets and sequences will be required to provide acceptable performance. The advent of object-oriented and extensible database systems will not solve this problem. On ..."
Abstract - Cited by 767 (11 self) - Add to MetaCart
Database management systems will continue to manage large data volumes. Thus, efficient algorithms for accessing and manipulating large sets and sequences will be required to provide acceptable performance. The advent of object-oriented and extensible database systems will not solve this problem

Fast subsequence matching in time-series databases

by Christos Faloutsos, M. Ranganathan, Yannis Manolopoulos - PROCEEDINGS OF THE 1994 ACM SIGMOD INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA , 1994
"... We present an efficient indexing method to locate 1-dimensional subsequences within a collection of sequences, such that the subsequences match a given (query) pattern within a specified tolerance. The idea is to map each data sequence into a small set of multidimensional rectangles in feature space ..."
Abstract - Cited by 533 (24 self) - Add to MetaCart
space. Then, these rectangles can be readily indexed using traditional spatial access methods, like the R*-tree [9]. In more detail, we use a sliding window over the data sequence and extract its features; the result is a trail in feature space. We propose an ecient and eective algorithm to divide

SCOP: a structural classification of proteins database for the investigation of sequences and structures.

by Tim J P Hubbard , Bart Ailey , Steven E Brenner , Alexey G Murzin , Cyrus Chothia - J. Mol. Biol. , 1995
"... ABSTRACT The Structural Classification of Proteins (SCOP) database provides a detailed and comprehensive description of the relationships of all known proteins structures. The classification is on hierarchical levels: the first two levels, family and superfamily, describe near and far evolutionary ..."
Abstract - Cited by 1552 (24 self) - Add to MetaCart
algorithms and for the generation of population statistics on protein structures. The database and its associated files are freely accessible from a number of WWW sites mirrored from URL http://scop.mrc-lmb.cam.ac.uk/scop/

Enhancing Database Access Control with

by Sonia Jahid, Imranul Hoque, Hamed Okhravi, Carl A. Gunter - XACML Policy, poster at 16 th ACM Conference on Computer and Communications Security, http://www.cs.illinois.edu/homes/sjahid2/pub/myabdac-ccs09-abstractJahidHOG.pdf , 2009
"... XACML is apparently the most convenient way to express attribute-based access control policies. Though XACML has been used in several access control areas, processing XACML policies for attribute-based database access control still has not been studied in depth. In this work we compile XACML policie ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
XACML is apparently the most convenient way to express attribute-based access control policies. Though XACML has been used in several access control areas, processing XACML policies for attribute-based database access control still has not been studied in depth. In this work we compile XACML

Private Information Retrieval

by Benny Chor, et al.
"... We describe schemes that enable a user to access k replicated copies of a database ( k * 2) and privately retrieve informationstored in the database. This means that each individual database gets no information on the identity of the item retrieved by the user. For a single database, achieving thi ..."
Abstract - Cited by 558 (14 self) - Add to MetaCart
We describe schemes that enable a user to access k replicated copies of a database ( k * 2) and privately retrieve informationstored in the database. This means that each individual database gets no information on the identity of the item retrieved by the user. For a single database, achieving

Mobile Database Access

by Alexander Schill, Wito Böhmak, Lutz Heuser
"... This paper discusses the typical problems and requirements of such a service and presents the design and implementation of a mobile database access facility. Typical problems addressed are bandwidth limitations, dynamic disconnection, and concurrent access by multiple mobile users. The concepts are ..."
Abstract - Add to MetaCart
This paper discusses the typical problems and requirements of such a service and presents the design and implementation of a mobile database access facility. Typical problems addressed are bandwidth limitations, dynamic disconnection, and concurrent access by multiple mobile users. The concepts

The SWISS-MODEL Workspace: A web-based environment for protein structure homology modelling

by Konstantin Arnold, Lorenza Bordoli, Torsten Schwede, et al. - BIOINFORMATICS , 2005
"... Motivation: Homology models of proteins are of great interest for planning and analyzing biological experiments when no experimental three-dimensional structures are available. Building homology models requires specialized programs and up-to-date sequence and structural databases. Integrating all re ..."
Abstract - Cited by 575 (5 self) - Add to MetaCart
required tools, programs and databases into a single web-based workspace facilitates access to homology modelling from a computer with web connection without the need of downloading and installing large program packages and databases. Results: SWISS-MODEL Workspace is a web-based integrated service

The ubiquitous B-tree

by Douglas Comer - ACM Computing Surveys , 1979
"... B-trees have become, de facto, a standard for file organization. File indexes of users, dedicated database systems, and general-purpose access methods have all been proposed and nnplemented using B-trees This paper reviews B-trees and shows why they have been so successful It discusses the major var ..."
Abstract - Cited by 653 (0 self) - Add to MetaCart
B-trees have become, de facto, a standard for file organization. File indexes of users, dedicated database systems, and general-purpose access methods have all been proposed and nnplemented using B-trees This paper reviews B-trees and shows why they have been so successful It discusses the major
Results 1 - 10 of 19,880