Results 1 - 10 of 5,371

On the desirability of acyclic database schemes

by Catriel Beeri, Ronald Fagin, David Maier, Mihalis Yannakakis , 1983
"... A class of database schemes, called acychc, was recently introduced. It is shown that this class has a number of desirable properties. In particular, several desirable properties that have been studied by other researchers m very different terms are all shown to be eqmvalent to acydicity. In additi ..."
Abstract - Cited by 205 (2 self) - Add to MetaCart
A class of database schemes, called acychc, was recently introduced. It is shown that this class has a number of desirable properties. In particular, several desirable properties that have been studied by other researchers m very different terms are all shown to be eqmvalent to acydicity

Weakly independent database schemes

by Ke Wang , Weining Zhang , Siu-Cheung Chau
"... Abstract. Independent database schemes are best known to have constraints enforced globally by enforcing them locally in individual relations, and therefore are highly desirable in an updates-busy and distributed environment. However, independence excludes all database schemes with interrelational ..."
Abstract - Add to MetaCart
Abstract. Independent database schemes are best known to have constraints enforced globally by enforcing them locally in individual relations, and therefore are highly desirable in an updates-busy and distributed environment. However, independence excludes all database schemes with interrelational

EQUIVALENCE AND NAPPING OF DATABASE SCHEMES

by unknown authors
"... We investigate the problem of data-base equivalence which arises in database design process. We introduce a graph formalism for the treatment of this problem. More precisely, we represent Entity-Relationship schemes by a special kind of graphs (called JFD-graphs) and we give a simple and efficient a ..."
Abstract - Add to MetaCart
We investigate the problem of data-base equivalence which arises in database design process. We introduce a graph formalism for the treatment of this problem. More precisely, we represent Entity-Relationship schemes by a special kind of graphs (called JFD-graphs) and we give a simple and efficient

Degrees of acyclicity for hypergraphs and relational database schemes

by Ronald Fagin - Journal of the ACM , 1983
"... Abstract. Database schemes (winch, intuitively, are collecuons of table skeletons) can be wewed as hypergraphs (A hypergraph Is a generalization of an ordinary undirected graph, such that an edge need not contain exactly two nodes, but can instead contain an arbitrary nonzero number of nodes.) A cla ..."
Abstract - Cited by 103 (2 self) - Add to MetaCart
Abstract. Database schemes (winch, intuitively, are collecuons of table skeletons) can be wewed as hypergraphs (A hypergraph Is a generalization of an ordinary undirected graph, such that an edge need not contain exactly two nodes, but can instead contain an arbitrary nonzero number of nodes.) A

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

Design of Desirable Relational Database Schemes

by Li-yan Yuan, Z. Meral Ozsoyoglu - JCSS 1992 , 1992
"... We define extended conflict free dependencies in the context of functional and multivalued dependencies; and prove that there exists an acyclic, dependency preserving, 4NF database scheme if and only if the given set of dependencies has an extended conflict free cover. This condition can be checked ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
We define extended conflict free dependencies in the context of functional and multivalued dependencies; and prove that there exists an acyclic, dependency preserving, 4NF database scheme if and only if the given set of dependencies has an extended conflict free cover. This condition can be checked

Imagenet: A large-scale hierarchical image database

by Jia Deng, Wei Dong, Richard Socher, Li-jia Li, Kai Li, Li Fei-fei - In CVPR , 2009
"... The explosion of image data on the Internet has the potential to foster more sophisticated and robust models and algorithms to index, retrieve, organize and interact with images and multimedia data. But exactly how such data can be harnessed and organized remains a critical problem. We introduce her ..."
Abstract - Cited by 840 (28 self) - Add to MetaCart
datasets. Constructing such a large-scale database is a challenging task. We describe the data collection scheme with Amazon Mechanical Turk. Lastly, we illustrate the usefulness of ImageNet through three simple applications in object recognition, image classification and automatic object clustering. We

NiagaraCQ: A Scalable Continuous Query System for Internet Databases

by Jianjun Chen, David J. Dewitt, Feng Tian, Yuan Wang - In SIGMOD , 2000
"... Continuous queries are persistent queries that allow users to receive new results when they become available. While continuous query systems can transform a passive web into an active environment, they need to be able to support millions of queries due to the scale of the Internet. No existing syste ..."
Abstract - Cited by 584 (9 self) - Add to MetaCart
are added to existing query groups, without having to regroup already installed queries. Second, we use a query-split scheme that requires minimal changes to a general-purpose query engine. Third, NiagaraCQ groups both change-based and timer-based queries in a uniform way. To insure that Niagara

Scalable Recognition with a Vocabulary Tree

by David Nistér, Henrik Stewénius - IN CVPR , 2006
"... A recognition scheme that scales efficiently to a large number of objects is presented. The efficiency and quality is exhibited in a live demonstration that recognizes CD-covers from a database of 40000 images of popular music CD's. The scheme ..."
Abstract - Cited by 1051 (0 self) - Add to MetaCart
A recognition scheme that scales efficiently to a large number of objects is presented. The efficiency and quality is exhibited in a live demonstration that recognizes CD-covers from a database of 40000 images of popular music CD's. The scheme

Semistructured Database Scheme Evolution and Refactoring

by D. Luciv , 2004
"... Database schema evolution is interesting and actual research area now because of intensive development of applications which architecture and database schema depend on each other. Here we describe semistructured database schema evolution mechanisms. ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Database schema evolution is interesting and actual research area now because of intensive development of applications which architecture and database schema depend on each other. Here we describe semistructured database schema evolution mechanisms.
Results 1 - 10 of 5,371