Z. Ozsoyoglu - Academia.edu (original) (raw)
Papers by Z. Ozsoyoglu
Very Large Data Bases, Aug 30, 2005
IEEE Transactions on Knowledge and Data Engineering, Sep 1, 2002
Abstract This paper describes VISUAL, a graphical icon-based query language with a user-friendly ... more Abstract This paper describes VISUAL, a graphical icon-based query language with a user-friendly graphical user interface for scientific databases, and its query processing techniques. VISUAL is suitable for domains where visualization of the relationships is important for the domain scientist to express queries. In VISUAL, graphical objects are not tied to the underlying formalism; instead, they represent the relationships of
Lecture Notes in Computer Science, 1993
Page 1. A NORMAL FORM FOR NESTED RELATIONS* (Extended Abstract) Z. Meral Ozsoyoglu and Li-Yan Yua... more Page 1. A NORMAL FORM FOR NESTED RELATIONS* (Extended Abstract) Z. Meral Ozsoyoglu and Li-Yan Yuan ... The advantages of * This research is supported in part by the NSF under Grant No 830136113, aad aa IBM Faculty Development Award. ...
Abstract This paper presents a feature-complete translation from SPARQL, the proposed standard fo... more Abstract This paper presents a feature-complete translation from SPARQL, the proposed standard for RDF querying, into efficient SQL. We propose" SQL model"-based algorithms that implement each SPARQL algebra operator via SQL query augmentation, and ...
Statistical and Scientific Database Management, Jun 21, 2004
XML is a semistructured data format that is quickly becoming the standard means of communication ... more XML is a semistructured data format that is quickly becoming the standard means of communication across the Internet. We introduce a simple, powerful, unambiguous tree-structured user-interface for querying semistructured data. It emphasizes ease-of-use and provides generic access to XML repositories. An implementation of this interface called the Pathways Explorer has been built in the context of biological pathways. The implementation illustrates some basic capabilities, such as selection, projection, equijoins, and self-joins. It builds efficient queries using SQL, and it has been shown that XQuery's performance would be comparable. Future implementations might allow semantic client-side caching, aggregation and grouping, recursion, and set operations.
ABSTRACT Genealogy information is becoming increasingly abundant in light of modern genetics and ... more ABSTRACT Genealogy information is becoming increasingly abundant in light of modern genetics and the study of diseases and risk factors. As the volume of this structured pedigree data expands, there is a pressing need for better ways to manage, store, and efficiently query this data. Building on recent advances in semi-structured data management and proven relational database technology, we propose a general-purpose pedigree query language (PQL) and evaluation framework for elegantly expressing and efficiently evaluating queries on this data. In this paper, we describe how the problem of modeling and querying pedigree data differs from XML, present an overview of PQL, and present efficient evaluation for key parts of the language. Experimental results using real data show significant (>850%) performance improvement for complex queries over naive evaluation
Journal of the Association for Information Science and Technology, Oct 29, 2003
Statistical and Scientific Database Management, Jun 21, 2004
This work offers some improvements in the current distance-based indexing techniques. An optimal ... more This work offers some improvements in the current distance-based indexing techniques. An optimal similarity search algorithm that is adopted from vector-based indexing is shown to be also optimal for distance-based indices. Farther similarity between the two types of indexing is revealed, leading to a general description of search structures. A probabilistic analysis of distance-based tree indices is also shown to
IEEE Transactions on Knowledge and Data Engineering, Mar 1, 2004
ABSTRACT In this work we describe a general framework for semi-automated semantic digital photo a... more ABSTRACT In this work we describe a general framework for semi-automated semantic digital photo annotation though the use of suggestions. We compare context-based methods with Latent Semantic Indexing, a linear algebra approach to information retrieval. Through experiments on real data sets containing up to 13,705 semantically annotated photos, we show that a carefully chosen combination of context-based methods can not only be efficient, but also extremely effective as well. Furthermore, we propose a new combination of context-based methods that outperforms previous work by up to 19% higher recall while running up to 21 times faster.
Information Systems, Sep 1, 2009
Journal of Bioinformatics and Computational Biology, Apr 1, 2011
A direct extension to the counting method is presented which can deal efficiently with both acycl... more A direct extension to the counting method is presented which can deal efficiently with both acyclic and cyclic relations. The extension to cycle cases, called the synchronized counting method, is simulated and studied using a Petri net model. Worst-case analysis shows that n2 semijoin operations are required, where n is the number of nodes in the graph representing the relevant
Animal Genetics, Aug 1, 2006
Many new database applications involve querying of graph data. In this paper, we present an objec... more Many new database applications involve querying of graph data. In this paper, we present an object-oriented graph data model, and an OQL like graph query language, GOQL. The data model and the language are illustrated in the application domain of multimedia presentation ...
Very Large Data Bases, Aug 30, 2005
IEEE Transactions on Knowledge and Data Engineering, Sep 1, 2002
Abstract This paper describes VISUAL, a graphical icon-based query language with a user-friendly ... more Abstract This paper describes VISUAL, a graphical icon-based query language with a user-friendly graphical user interface for scientific databases, and its query processing techniques. VISUAL is suitable for domains where visualization of the relationships is important for the domain scientist to express queries. In VISUAL, graphical objects are not tied to the underlying formalism; instead, they represent the relationships of
Lecture Notes in Computer Science, 1993
Page 1. A NORMAL FORM FOR NESTED RELATIONS* (Extended Abstract) Z. Meral Ozsoyoglu and Li-Yan Yua... more Page 1. A NORMAL FORM FOR NESTED RELATIONS* (Extended Abstract) Z. Meral Ozsoyoglu and Li-Yan Yuan ... The advantages of * This research is supported in part by the NSF under Grant No 830136113, aad aa IBM Faculty Development Award. ...
Abstract This paper presents a feature-complete translation from SPARQL, the proposed standard fo... more Abstract This paper presents a feature-complete translation from SPARQL, the proposed standard for RDF querying, into efficient SQL. We propose" SQL model"-based algorithms that implement each SPARQL algebra operator via SQL query augmentation, and ...
Statistical and Scientific Database Management, Jun 21, 2004
XML is a semistructured data format that is quickly becoming the standard means of communication ... more XML is a semistructured data format that is quickly becoming the standard means of communication across the Internet. We introduce a simple, powerful, unambiguous tree-structured user-interface for querying semistructured data. It emphasizes ease-of-use and provides generic access to XML repositories. An implementation of this interface called the Pathways Explorer has been built in the context of biological pathways. The implementation illustrates some basic capabilities, such as selection, projection, equijoins, and self-joins. It builds efficient queries using SQL, and it has been shown that XQuery's performance would be comparable. Future implementations might allow semantic client-side caching, aggregation and grouping, recursion, and set operations.
ABSTRACT Genealogy information is becoming increasingly abundant in light of modern genetics and ... more ABSTRACT Genealogy information is becoming increasingly abundant in light of modern genetics and the study of diseases and risk factors. As the volume of this structured pedigree data expands, there is a pressing need for better ways to manage, store, and efficiently query this data. Building on recent advances in semi-structured data management and proven relational database technology, we propose a general-purpose pedigree query language (PQL) and evaluation framework for elegantly expressing and efficiently evaluating queries on this data. In this paper, we describe how the problem of modeling and querying pedigree data differs from XML, present an overview of PQL, and present efficient evaluation for key parts of the language. Experimental results using real data show significant (>850%) performance improvement for complex queries over naive evaluation
Journal of the Association for Information Science and Technology, Oct 29, 2003
Statistical and Scientific Database Management, Jun 21, 2004
This work offers some improvements in the current distance-based indexing techniques. An optimal ... more This work offers some improvements in the current distance-based indexing techniques. An optimal similarity search algorithm that is adopted from vector-based indexing is shown to be also optimal for distance-based indices. Farther similarity between the two types of indexing is revealed, leading to a general description of search structures. A probabilistic analysis of distance-based tree indices is also shown to
IEEE Transactions on Knowledge and Data Engineering, Mar 1, 2004
ABSTRACT In this work we describe a general framework for semi-automated semantic digital photo a... more ABSTRACT In this work we describe a general framework for semi-automated semantic digital photo annotation though the use of suggestions. We compare context-based methods with Latent Semantic Indexing, a linear algebra approach to information retrieval. Through experiments on real data sets containing up to 13,705 semantically annotated photos, we show that a carefully chosen combination of context-based methods can not only be efficient, but also extremely effective as well. Furthermore, we propose a new combination of context-based methods that outperforms previous work by up to 19% higher recall while running up to 21 times faster.
Information Systems, Sep 1, 2009
Journal of Bioinformatics and Computational Biology, Apr 1, 2011
A direct extension to the counting method is presented which can deal efficiently with both acycl... more A direct extension to the counting method is presented which can deal efficiently with both acyclic and cyclic relations. The extension to cycle cases, called the synchronized counting method, is simulated and studied using a Petri net model. Worst-case analysis shows that n2 semijoin operations are required, where n is the number of nodes in the graph representing the relevant
Animal Genetics, Aug 1, 2006
Many new database applications involve querying of graph data. In this paper, we present an objec... more Many new database applications involve querying of graph data. In this paper, we present an object-oriented graph data model, and an OQL like graph query language, GOQL. The data model and the language are illustrated in the application domain of multimedia presentation ...