Sciweavers

4335 search results - page 820 / 867
» Ontology Engineering Relationally
Sort
View
FSTTCS
2009
Springer
14 years 3 months ago
Fractional Pebbling and Thrifty Branching Programs
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...
Mark Braverman, Stephen A. Cook, Pierre McKenzie, ...
ICDE
2009
IEEE
205views Database» more  ICDE 2009»
14 years 10 months ago
Top-k Exploration of Query Candidates for Efficient Keyword Search on Graph-Shaped (RDF) Data
Keyword queries enjoy widespread usage as they represent an intuitive way of specifying information needs. Recently, answering keyword queries on graph-structured data has emerged ...
Thanh Tran, Haofen Wang, Sebastian Rudolph, Philip...
ICDE
2006
IEEE
146views Database» more  ICDE 2006»
14 years 10 months ago
Query Selection Techniques for Efficient Crawling of Structured Web Sources
The high quality, structured data from Web structured sources is invaluable for many applications. Hidden Web databases are not directly crawlable by Web search engines and are on...
Ping Wu, Ji-Rong Wen, Huan Liu, Wei-Ying Ma
ICDE
2003
IEEE
148views Database» more  ICDE 2003»
14 years 10 months ago
Efficient Computation of Subqueries in Complex OLAP
Expressing complex OLAP queries using group-by, aggregation, and joins can be extremely difficult. As a result of this, many alternate ways of expressing such queries have been de...
Michael H. Böhlen, Michael O. Akinde
ICDE
1998
IEEE
119views Database» more  ICDE 1998»
14 years 10 months ago
Processing Incremental Multidimensional Range Queries in a Direct Manipulation Visual Query
We have developed a MultiMedia Visual Information Seeking (MMVIS) Environment that is the first system to support an integrated approach to the direct manipulation specification o...
Stacie Hibino, Elke A. Rundensteiner