Results 1  10
of
13,220
Graphbased algorithms for Boolean function manipulation
 IEEE TRANSACTIONS ON COMPUTERS
, 1986
"... In this paper we present a new data structure for representing Boolean functions and an associated set of manipulation algorithms. Functions are represented by directed, acyclic graphs in a manner similar to the representations introduced by Lee [1] and Akers [2], but with further restrictions on th ..."
Abstract

Cited by 3526 (46 self)
 Add to MetaCart
In this paper we present a new data structure for representing Boolean functions and an associated set of manipulation algorithms. Functions are represented by directed, acyclic graphs in a manner similar to the representations introduced by Lee [1] and Akers [2], but with further restrictions
Primitives for the manipulation of general subdivisions and the computations of Voronoi diagrams
 ACM Tmns. Graph
, 1985
"... The following problem is discussed: Given n points in the plane (the sites) and an arbitrary query point 4, find the site that is closest to q. This problem can be solved by constructing the Voronoi diagram of the given sites and then locating the query point in one of its regions. Two algorithms ar ..."
Abstract

Cited by 534 (11 self)
 Add to MetaCart
to the separation of the geometrical and topological aspects of the problem and to the use of two simple but powerful primitives, a geometric predicate and an operator for manipulating the topology of the diagram. The topology is represented by a new data structure for generalized diagrams, that is, embeddings
Photobook: ContentBased Manipulation of Image Databases
, 1995
"... We describe the Photobook system, which is a set of interactive tools for browsing and searching images and image sequences. These query tools differ from those used in standard image databases in that they make direct use of the image content rather than relying on text annotations. Direct search o ..."
Abstract

Cited by 542 (0 self)
 Add to MetaCart
tools, fish, texture swatches, and 3D medical data.
Data Manipulation on the Distributed Computer
"... We consider fundamental data manipulation operations such as broadcasting, prefix sum, data sum, data shift, data accumulation, consecutive sum, adjacent sum, sorting, and random access reads and writes, and show how these may be performed on the distributed memory bus computer (DMBC). In addition, ..."
Abstract
 Add to MetaCart
We consider fundamental data manipulation operations such as broadcasting, prefix sum, data sum, data shift, data accumulation, consecutive sum, adjacent sum, sorting, and random access reads and writes, and show how these may be performed on the distributed memory bus computer (DMBC). In addition
The EntityRelationship Model: Toward a Unified View of Data
 ACM Transactions on Database Systems
, 1976
"... A data model, called the entityrelationship model, is proposed. This model incorporates some of the important semantic information about the real world. A special diagrammatic technique is introduced as a tool for database design. An example of database design and description using the model and th ..."
Abstract

Cited by 1829 (6 self)
 Add to MetaCart
and the diagrammatic technique is given. Some implications for data integrity, information retrieval, and data manipulation are discussed. The entityrelationship model can be used as a basis for unification of different views of data: t,he network model, the relational model, and the entity set model. Semantic
Data Manipulation in Perl
"... We are fortunate to have many different tools  statistical packages, spreadsheets, or database systems  for analysis and presentation of data. But often the first step in an analysis is manipulating or massaging the original data into a form that can be read by the package. Experienced Unix a ..."
Abstract
 Add to MetaCart
We are fortunate to have many different tools  statistical packages, spreadsheets, or database systems  for analysis and presentation of data. But often the first step in an analysis is manipulating or massaging the original data into a form that can be read by the package. Experienced Unix
Data Manipulation in Perl
"... We are fortunate to have many different tools  statistical packages, spreadsheets, or database systems  for analysis and presentation of data. But often the first step in an analysis is manipulating or massaging the original data into a form that can be read by the package. Experienced Unix a ..."
Abstract
 Add to MetaCart
We are fortunate to have many different tools  statistical packages, spreadsheets, or database systems  for analysis and presentation of data. But often the first step in an analysis is manipulating or massaging the original data into a form that can be read by the package. Experienced Unix a
Access path selection in a relational database management system
, 1979
"... ABSTRACT: In a high level query and data manipulation language such as SQL, requests are stated nonprocedurally, 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 nonprocedurally, 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
Partial Functions in Data Manipulation
"... In this paper we take a look at partial functions and their applications in computer science. The axiomatization from [1] has been introduced to formally derive equality between partial functions. We work with algebras satisfying this axiomatization and a finite generation assumption which is satisf ..."
Abstract
 Add to MetaCart
In this paper we take a look at partial functions and their applications in computer science. The axiomatization from [1] has been introduced to formally derive equality between partial functions. We work with algebras satisfying this axiomatization and a finite generation assumption which is satisfied by all finite algebras of the axiomatic class specified in [1]. First we introduce the algebra of partial functions and give some useful properties. We distinguish most basic functions, which are the building blocks of partial function algebras. These functions cannot be decomposed in smaller elements, so are in fact atoms. After that, we take a look at a more general family of algebras, namely the subalgebras of partial function algebras. In particular, we will show that these subalgebras can easily be described up to isomorphism, by placing a restriction on the images of partial functions. We will also note that the most basic functions can be used to construct a coordinate system, as every partial function can be composed of most basic
Query evaluation techniques for large databases
 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 objectoriented 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 objectoriented and extensible database systems will not solve this problem
Results 1  10
of
13,220