Learn More
We define a language G for querying data represented as a labeled graph <italic>G</italic>. By considering <italic>G</italic> as a relation, this graphical query language can be viewed as a relational query language, and its expressive power can be compared to that of other relational query languages. We do not propose G as an alternative to general purpose(More)
We present the AgreementMaker system for matching real-world schemas and ontologies, which may consist of hundreds or even thousands of concepts. The end users of the system are sophisticated domain experts whose needs have driven the design and implementation of the system: they require a responsive, powerful, and extensible framework to perform, evaluate,(More)
Human-computer interaction (HCI) is the study of how people design, implement , and use interactive computer systems and how computers affect individuals , organizations, and society. This encompasses not only ease of use but also new interaction techniques for supporting user tasks, providing better access to information, and creating more powerful forms(More)
The AgreementMaker system for ontology matching includes an extensible architecture that facilitates the integration and performance tuning of a variety of matching methods, an evaluation mechanism, which can make use of a reference matching or rely solely on " inherent " quality measures, and a multipurpose user interface, which drives both the matching(More)
We propose a layered framework for the integration of syntactically , schematically, and semantically heterogeneous networked data sources. Their heterogeneity stems from different models (e.g., rela-tional, XML, or RDF), different schemas within the same model, and different terms associated with the same meaning. We use a semantic based approach that uses(More)
This paper presents an approach for representing queries in natural language as semantic networks. The semantic representation is intended to facilitate the translation between natural language and database queries. A domain agnostic algorithm, based on shallow features, is used to map a sentence to a sub-network of concepts within a larger ontology. This(More)
We consider the problem of enabling interoperability and information sharing among geospa-tial applications that use ontologies to describe their concepts and the relationships among them. We present two fully automatic alignment methods that use the graph structures of a pair of ontologies to establish their alignment, that is, the semantic correspondences(More)