In order to accomplish independence on the logical data organization, a relational DBMS must be capable of interpreting query language sentences which reference attributes belonging to different relations even if the necessary joins are not explicitly formulated (query inference problem). In this work we propose an SQL extension which supports concise formulation of queries through the dynamic ...

In this paper we investigate how a small number of high-level concepts derived for video shots, such as Sports, Face, Indoor, etc., can be used effectively for ad hoc search in video material. We will answer the following questions: 1) Can we automatically construct concept queries from ordinary text queries? 2) What is the best way to combine evidence from single concept detectors into final s...

XML is now an established standard for data communication and representation. There has been considerable work on XML querying, modeling, and type definition. However, one of the most important aspects of XML, standardized tag naming for conveying semantics, has been almost ignored by the research community. This paper argues that the naming aspects of XML are important to consider and presents...

When issuing user-specific queries, users often have a vaguely defined information need. Skyline queries identify the most “interesting” objects for users’ incomplete preferences, which provides users with intuitive query formulation mechanism. However, the applicability of this intuitive query paradigm suffers from a severe drawback. Incomplete preferences on domain values can often lead to im...

As larger and more heterogeneous text databases become available, information retrieval research will depend on the development of powerful, eecient and exible retrieval engines. In this paper , we describe a retrieval system (IN-QUERY) that is based on a probabilis-tic retrieval model and provides support for sophisticated indexing and complex query formulation. INQUERY has been used successfu...

We present VIIQ (pronounced as wick), an interactive and iterative visual query formulation interface that helps users construct query graphs specifying their exact query intent. Heterogeneous graphs are increasingly used to represent complex relationships in schemaless data, which are usually queried using query graphs. Existing graph query systems offer little help to users in easily choosing...

The concepts of dynamic queries and query previews have shown to be useful in information systems because they allow users to search for information by directly manipulating a visual representation of the query and getting immediate and continuous feedback about the results. To enhance dynamic queries and query previews we combined them with dynamic screen layout for query formulation and a vis...

vspace{0.2cm}In this paper, we design a data structure for the following problem. Let $pi$ be an $x$-monotone trajectory with $n$ vertices in the plane and $epsilon >0$. We show how to preprocess $pi$ and $epsilon$ into a data structure such that for any horizontal query segment $Q$ in the plane, one can quickly determine the minimal continuous fraction of $pi$ whose Fr{'e}chet and Hausdo...