552 search results - page 43 / 111 » On the Complexity of Join Predicates |
129
click to vote
DLOG
2007
15 years 5 months ago
2007
We develop a formal framework for modular ontologies by analysing four notions of conservative extensions and their applications in refining, re-using, merging, and segmenting ont...
127
click to vote
PDPTA
2000
15 years 4 months ago
2000
Abstract We describe an event-based, publishand-subscribe system based on using "smart subscriptions" to recognize weakly structured events. We present a hierarchy of sub...
155
Voted
COMPGEOM
2008
ACM
15 years 5 months ago
2008
ACM
The Delaunay triangulation and its dual the Voronoi diagram are ubiquitous geometric complexes. From a topological standpoint, the connection has recently been made between these ...
152
click to vote
PPDP
2010
Springer
15 years 1 months ago
2010
Springer
Given a set of Datalog rules, facts, and a query, answers to the query can be inferred bottom-up starting with the facts or top-down starting with the query. For efficiently answe...
128
Voted
EDBT
2006
ACM
16 years 3 months ago
2006
ACM
: This work describes a method for processing XPath on a relational back-end that significantly limits the number of SQL joins required, takes advantage of the strengths of modern ...