Effective information disclosure in the context of databases with a large conceptual schema is known to be a non-trivial problem. In particular the formulation of ad-hoc queries is a major problem in such contexts. Existing approaches for tackling this problem include graphical query interfaces, query by navigation, query by construction, and point to point queries. In this report we propose an...

The staples of information retrieval have been querying and search, respectively, for structured and unstructured repositories. Processing queries over known, structured repositories (e.g., Databases) has been well-understood, and search has become ubiquitous when it comes to unstructured repositories (e.g., Web). Furthermore, searching structured repositories has been explored to a limited ext...

Given a document d, the task of text reuse detection is to find those passages in d which in identical or paraphrased form also appear in other documents. To solve this problem at web-scale, keywords representing d’s topics have to be combined to web queries. The retrieved web documents can then be delivered to a text reuse detection system for an in-depth analysis. We focus on the query formul...

Even if high-level query languages are used, query formulation may cause problems. This is notably so in case of large and complex application domains. Typical examples of these kinds of application domains are evolving application domains. In an evolving application domain not only populations may change, but also the conceptual schema. Even more, the history of the application domain should b...

Even if high-level query languages are used, query formulation may cause problems. This is notably so in case of large and complex application domains. Typical examples of these kinds of application domains are evolving application domains. In an evolving application domain not only populations may change, but also the conceptual schema. Even more, the history of the application domain should b...

In this paper we investigate the relation between modern hypertext approaches and conventional data modelling techniques, such as PSM. We show how query formulation in a traditional information system can be regarded as a stratified hypermedia featuring two levels of abstraction. The first level of abstraction covers the structure of the stored information, and the second level the information ...

In a networked information system, there are three major obstacles facing users in a querying process: network performance, data volume and data complexity. In order to overcome these obstacles, we propose a two-phase approach to dynamic query formulation by volume preview. The two phases are the Query Preview and Query Refinement. In the Query Preview phase, users formulate an initial query by...

In this document, we describe our algorithms for automatic query expansion. The proposed algorithms are implemented in Java where the Lucene library 1 is modified and used by the proposed algorithms for document retrieval. In order to support accurate document retrieval, we have implemented the okapi(BM25) formulation 2 for measuring the document-query similarity measure. Three query expansion ...

Query formulation in the context of large conceptual schemata is known to be a hard problem. When formulating ad-hoc queries users may become overwhelmed by the vast amount of information that is stored in the information system; leading to a feeling of lost in conceptual space. In this article we develop a strategy to cope with this problem. This strategy is based on ideas from the information...

In this paper, we present a novel approach for contextual and concept based query formulation in web-based information retrieval, which is an on-going PhD project being undertaken at the Software Engineering Research Lab (SERL) at Auckland University of Technology (AUT). Various query formulation approaches have been studied for a long time with varying degree of success. To the best of our kno...