2145 search results - page 238 / 429 » Pattern-Based Query Answering |
109
Voted
SIGMOD
2004
ACM
16 years 2 months ago
2004
ACM
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
120
Voted
EDBT
2006
ACM
16 years 2 months ago
2006
ACM
Incomplete databases, that is, databases that are missing data, are present in many research domains. It is important to derive techniques to access these databases efficiently. We...
143
click to vote
NCA
2009
IEEE
15 years 9 months ago
2009
IEEE
—In industries such as healthcare, there is a need to electronically share privacy-sensitive data across distinct organizations. We show how this can be done while allowing organ...
125
click to vote
SEMWEB
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. This paper presents a decidable fragment for combining ontologies and rules in order-sorted logic programming. We describe ordersorted logic programming with sort, predic...
136
click to vote
NCA
2008
IEEE
15 years 8 months ago
2008
IEEE
— Data-centric storage [6] is a very important concept for sensor networks that supports efficient in-network data query and processing. Previous approaches are mostly using a h...