Results 1 - 10 of 3,650

Graph Queries through Datalog Optimizations

by K. Tuncay Tekle , Michael Gorbovitski, Yanhong A. Liu , 2010
"... This paper describes the use of a powerful graph query language for querying programs, and a novel combination of transformations for generating efficient implementations of the queries. The language supports graph path expressions that allow convenient use of both vertices and edges of arbitrary ki ..."
Abstract - Cited by 5 (1 self) - Add to MetaCart
This paper describes the use of a powerful graph query language for querying programs, and a novel combination of transformations for generating efficient implementations of the queries. The language supports graph path expressions that allow convenient use of both vertices and edges of arbitrary

Search and replication in unstructured peer-to-peer networks

by Qin Lv, Pei Cao, Edith Cohen, Kai Li, Scott Shenker , 2002
"... Abstract Decentralized and unstructured peer-to-peer networks such as Gnutella are attractive for certain applicationsbecause they require no centralized directories and no precise control over network topologies and data placement. However, the flooding-based query algorithm used in Gnutella does n ..."
Abstract - Cited by 692 (6 self) - Add to MetaCart
not scale; each individual query gener-ates a large amount of traffic and, as it grows, the system quickly becomes overwhelmed with the query-induced load. This paper explores, through simulation, various alternatives to gnutella's query algorithm, data replicationmethod, and network topology. We

A Query Language and Optimization Techniques for Unstructured Data

by Peter Buneman, Susan Davidson, Gerd Hillebrand, Dan Suciu , 1996
"... A new kind of data model has recently emerged in which the database is not constrained by a conventional schema. Systems like ACeDB, which has become very popular with biologists, and the recent Tsimmis proposal for data integration organize data in tree-like structures whose components can be used ..."
Abstract - Cited by 407 (35 self) - Add to MetaCart
equally well to represent sets and tuples. Such structures allow great flexibility in data representation What query language is appropriate for such structures? Here we propose a simple language UnQL for querying data organized as a rooted, edge-labeled graph. In this model, relational data may

Practical Network Coding

by Philip A. Chou, Yunnan Wu, Kamal Jain , 2003
"... We propose a distributed scheme for practical network coding that obviates the need for centralized knowledge of the graph topology, the encoding functions, and the decoding functions, and furthermore obviates the need for information to be communicated synchronously through the network. The resu ..."
Abstract - Cited by 462 (15 self) - Add to MetaCart
We propose a distributed scheme for practical network coding that obviates the need for centralized knowledge of the graph topology, the encoding functions, and the decoding functions, and furthermore obviates the need for information to be communicated synchronously through the network

An optimal graph theoretic approach to data clustering: Theory and its application to image segmentation

by Zhenyu Wu, Richard Leahy - IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE , 1993
"... A novel graph theoretic approach for data clustering is presented and its application to the image segmentation problem is demonstrated. The data to be clustered are represented by an undirected adjacency graph G with arc capacities assigned to reflect the similarity between the linked vertices. Cl ..."
Abstract - Cited by 360 (0 self) - Add to MetaCart
. Clustering is achieved by removing arcs of G to form mutually exclusive subgraphs such that the largest inter-subgraph maximum flow is minimized. For graphs of moderate size (- 2000 vertices), the optimal solution is obtained through partitioning a flow and cut equivalent tree of 6, which can be efficiently

Toward Optimal Active Learning through Sampling Estimation of Error Reduction

by Nicholas Roy, Andrew Mccallum - In Proc. 18th International Conf. on Machine Learning , 2001
"... This paper presents an active learning method that directly optimizes expected future error. This is in contrast to many other popular techniques that instead aim to reduce version space size. These other methods are popular because for many learning models, closed form calculation of the expec ..."
Abstract - Cited by 353 (2 self) - Add to MetaCart
This paper presents an active learning method that directly optimizes expected future error. This is in contrast to many other popular techniques that instead aim to reduce version space size. These other methods are popular because for many learning models, closed form calculation

Optimization of Object-Oriented Programs using Static Class Hierarchy Analysis

by Jeffrey Dean, David Grove, Craig Chambers , 1995
"... Abstract. Optimizing compilers for object-oriented languages apply static class analysis and other techniques to try to deduce precise information about the possible classes of the receivers of messages; if successful, dynamicallydispatched messages can be replaced with direct procedure calls and po ..."
Abstract - Cited by 379 (18 self) - Add to MetaCart
and potentially further optimized through inline-expansion. By examining the complete inheritance graph of a program, which we call class hierarchy analysis, the compiler can improve the quality of static class information and thereby improve run-time performance. In this paper we present class hierarchy analysis

Freebase: a collaboratively created graph database for structuring human knowledge

by Kurt Bollacker, Colin Evans, Praveen Paritosh, Tim Sturge, Jamie Taylor - In SIGMOD Conference , 2008
"... Freebase is a practical, scalable tuple database used to struc-ture general human knowledge. The data in Freebase is collaboratively created, structured, and maintained. Free-base currently contains more than 125,000,000 tuples, more than 4000 types, and more than 7000 properties. Public read/write ..."
Abstract - Cited by 338 (1 self) - Add to MetaCart
/write access to Freebase is allowed through an HTTP-based graph-query API using the Metaweb Query Language (MQL) as a data query and manipulation language. MQL provides an easy-to-use object-oriented interface to the tuple data in Freebase and is designed to facilitate the creation of collaborative, Web

Retiming Synchronous Circuitry

by Charles E. Leiserson, James B. Saxe - ALGORITHMICA , 1991
"... This paper describes a circuit transformation called retiming in which registers are added at some points in a circuit and removed from others in such a way that the functional behavior of the circuit as a whole is preserved. We show that retiming can be used to transform a given synchronous circui ..."
Abstract - Cited by 376 (3 self) - Add to MetaCart
circuit into a more efficient circuit under a variety of different cost criteria. We model a circuit as a graph in which the vertex set Visa collection of combinational logic elements and the edge set E is the set of interconnections, each of which may pass through zero or more registers. We give an 0(|V

Optimizing Queries across Diverse Data Sources

by Laura M. Haas, Donald Kossmann, Edward L. Wimmers, Jun Yang - In Proc. of VLDB , 1997
"... Businesses today need to interrelate data stored in diverse systems with differing capabilities, ideally via a single high-level query interface. We present the design of a query optimizer for Gar- lic [C+95], a middleware system designed to integrate data from a broad range of data sources with ver ..."
Abstract - Cited by 284 (15 self) - Add to MetaCart
Businesses today need to interrelate data stored in diverse systems with differing capabilities, ideally via a single high-level query interface. We present the design of a query optimizer for Gar- lic [C+95], a middleware system designed to integrate data from a broad range of data sources
Results 1 - 10 of 3,650