Learn More
Skip graphs are a novel distributed data structure, based on skip lists, that provide the full functionality of a balanced tree in a distributed system where resources are stored in separate nodes that may fail at any time. They are designed for use in searching peer-to-peer systems, and by providing the ability to perform queries based on key ordering,(More)
Selecting the appropriate web service from a repository is a difficult problem as the terminology used to describe Web Services in repositories may not be identical to the one used in a query. In this paper, we explore the use of domain-independent and domain-specific ontologies to find matching service descriptions. The domain-independent relationships are(More)
One of the principal problems in Information Lifecycle Management is to align the business value of data with the most cost-effective and appropriate storage infrastructure. In this paper, we present ACE: a framework of tools for ILM, that classifies data and storage resources, and generates a data placement plan for informed utilization of the available(More)
[A02] K Aberer. Scalable data access in peer-to-peer systems using unbalanced search trees. E Pavlov. A generic scheme for building overlay networks in adversarial scenarios. process on the hypercube with applications to peer-to-peer networks. Proc. [AN86] M Aizenman and C M Newman. Discontinuity of the percolation density in one dimensional 1/|x − y| 2(More)
In this paper, we address the problem of searching schema databases for semantically-related schemas. We first give a method of finding semantic similarity between pair-wise schemas based on tokenization, part-of-speech tagging, word expansion, and ontology matching. We then address the problem of indexing the schema database through a semantic hash table.(More)
In modern biology, one of the most important research problems is to understand how protein sequences fold into their native 3D structures. To investigate this problem at a high level, one wishes to analyze the protein landscapes, i.e., the structures of the space of all protein sequences and their native 3D structures. Perhaps the most basic computational(More)