Sciweavers

491 search results - page 11 / 99
» Optimizing complex queries with multiple relation instances
Sort
View
ER
2004
Springer
163views Database» more  ER 2004»
13 years 11 months ago
From Ontology to Relational Databases
The semantic web envisions a World Wide Web in which data is described with rich semantics and applications can pose complex queries. Ontologies, a cornerstone of the semantic web,...
Anuradha Gali, Cindy X. Chen, Kajal T. Claypool, R...
WISE
2005
Springer
14 years 1 months ago
Scalable Instance Retrieval for the Semantic Web by Approximation
Abstract. Approximation has been identified as a potential way of reducing the complexity of logical reasoning. Here we explore approximation for speeding up instance retrieval in...
Holger Wache, Perry Groot, Heiner Stuckenschmidt
SIGMOD
2005
ACM
133views Database» more  SIGMOD 2005»
14 years 1 months ago
A Nested Relational Approach to Processing SQL Subqueries
One of the most powerful features of SQL is the use of nested queries. Most research work on the optimization of nested queries focuses on aggregate subqueries. However, the solut...
Bin Cao, Antonio Badia
CJ
2010
114views more  CJ 2010»
13 years 7 months ago
Using the Relational Model to Capture Topological Information of Spaces
Abstract. Motivated by research on how topology may be a helpful foundation for building information modeling (BIM), a relational database version of the notions of chain complex a...
Patrick Erik Bradley, Norbert Paul
IPPS
2009
IEEE
14 years 2 months ago
On the complexity of mapping pipelined filtering services on heterogeneous platforms
In this paper, we explore the problem of mapping filtering services on large-scale heterogeneous platforms. Two important optimization criteria should be considered in such a fra...
Anne Benoit, Fanny Dufossé, Yves Robert