George H. L. Fletcher

Learn More
Current approaches to RDF graph indexing suffer from weak data locality, i.e., information regarding a piece of data appears in multiple locations, spanning multiple data structures. Weak data locality negatively impacts storage and query processing costs. Towards stronger data locality, we propose a Three-way Triple Tree (TripleT) secondary memory indexing(More)
In this paper we introduce the first efficient external-memory algorithm to compute the bisimilarity equivalence classes of a directed acyclic graph (DAG). DAGs are commonly used to model data in a wide variety of practical applications, ranging from XML documents and data provenance models, to web taxonomies and scientific workflows. In the study of(More)
Stereotaxic injections of a dopamine D1 receptor agonist (SKF 38393) into different regions of the supersensitive striatum of rats with a unilateral 6-hydroxydopamine-induced lesion duplicated the systemic effects of the drug in a topographical manner. Although there was considerable overlap, it was possible to recognize discrete active zones or "hot-spots"(More)
—We give a language-independent characterization of the expressive power of the relational algebra on finite sets of source-target relation instance pairs. The associated decision problem is shown to be co-graph-isomorphism hard and in coNP. The main result is also applied in providing a new characterization of the generic relational queries.
We had earlier found that the numbers of mouse muscle nicotinic receptors expressed on the surface of individual cells of a stably transfected clonal line of quail fibroblasts varied from cell to cell (Kopta and Steinbach: J Neurosci 14:3922-3933, 1994). We have now used repeated selective passages of these clonal cells to produce a population of cells(More)
—Computing containment relations between massive collections of sets is a fundamental operation in data management, for example in graph analytics and data mining applications. Motivated by recent hardware trends, in this paper we present two novel solutions for computing set-containment joins over massive sets: the Patricia Trie-based Signature Join (PTSJ)(More)
Motivated by both established and new applications, we study navigational query languages for graphs (binary relations). The simplest language has only the two operators union and composition, together with the identity relation. We make more powerful languages by adding any of the following operators: intersection; set difference; projection; coprojection;(More)
Performing efficient decentralized search is a fundamental problem in Peer-to-Peer (P2P) systems. There has been a significant amount of research recently on developing robust self-organizing P2P topologies that support efficient search. In this paper we discuss four structured and unstructured P2P models (CAN, Chord, PRU, and Hy-pergrid) and three(More)