Advanced query language for manipulating complex entities

Niemi, Timo; Junkkari, Marko; Järvelin, Kalervo; Viita, Samu

doi:10.1016/s0306-4573(03)00065-7

Cited by 7 publications

(3 citation statements)

References 35 publications

(48 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As mentioned above, it is not possible to manipulate unknown contents and structures with conventional query language approaches. In a previous article (Niemi et al, 2004) we introduced a set of query primitives able to manipulate structures and contents in part-of relationships unknown to the user. Because these primitives were designed similarly to the primitives of this article, and because they are based on the same notion of variable, the integration of these primitives and the primitives of this article should be straightforward.…”

Section: Discussionmentioning

confidence: 99%

“…In fact, in modern applications the focus is often on finding out the unknown relationships among data. In Niemi, Junkkari, Järvelin, and Viita (2004), we introduced a query language for part-of relationships in which the user need not know the data content or structure of an entity based on the part-of relationship. For example, using this language the user is able to find physical assemblies containing material risky for the environment, without knowing parts, their attributes, or relationships among parts in available physical assemblies.…”

Section: Queries For Retrieving Xml Information In Documents Basedmentioning

confidence: 99%

See 1 more Smart Citation

A query language for discovering semantic associations, Part II: sample queries and query evaluation

Niemi¹,

Jämsen²

2007

J. Am. Soc. Inf. Sci.

Self Cite

View full text Add to dashboard Cite

In our query language introduced in Part I (Niemi & Jämsen, in press) the user can formulate queries to find out (possibly complex) semantic relationships among entities. In this article we demonstrate the usage of our query language and discuss the new applications that it supports. We categorize several query types and give sample queries. The query types are categorized based on whether the entities specified in a query are known or unknown to the user in advance, and whether text information in documents is utilized. Natural language is used to represent the results of queries in order to facilitate correct interpretation by the user. We discuss briefly the issues related to the prototype implementation of the query language and show that an independent operation like Rho (Sheth et al., 2005; Anyanwu & Sheth, 2002, 2003), which presupposes entities of interest to be known in advance, is exceedingly inefficient in emulating the behavior of our query language. The discussion also covers potential problems, and challenges for future work.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Queries For Retrieving Xml Information In Documents Basedmentioning

confidence: 99%

A query language for discovering semantic associations, Part II: sample queries and query evaluation

Niemi¹,

Jämsen²

2007

J. Am. Soc. Inf. Sci.

Self Cite

View full text Add to dashboard Cite

show abstract

“…Complex languages can be useful where the searcher wants to be very precise through the use of a detailed query (e.g., Pirkola, Puolamäki, & Järvelin, 2003) or where the data themselves are complex, for example, music data, which comprise different attributes such as timbre, tone, and pitch (Downie, 2004), each of which might be expressed as individual query components. Niemi, Junkkari, Järvelin, and Viita (2004) provide an example of the latter approach.…”

Section: Complex Query Languagesmentioning

confidence: 99%