327 search results - page 27 / 66 » Efficiently querying rdf data in triple stores |
SIGMOD
2004
ACM
14 years 7 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...
ICDE
2005
IEEE
14 years 9 months ago
2005
IEEE
We consider the problem of efficiently computing the skyline against the most recent N elements in a data stream seen so far. Specifically, we study the n-of-N skyline queries; th...
VLDB
2001
ACM
13 years 12 months ago
2001
ACM
We demonstrate a visual based XML-Relational database system where XML data is managed by commercial RDBMS. A query interface enables users to form path expression based queries a...
ADBIS
2000
Springer
13 years 11 months ago
2000
Springer
A number of algorithms of clustering spatial data for reducing the number of disk seeks required to process spatial queries have been developed. One of the algorithms is the scheme...
DEXAW
2007
IEEE
13 years 11 months ago
2007
IEEE
The problem of efficiently evaluating XPath and XQuery queries has become increasingly significant since more and more XML data is stored in its native form. We propose a novel op...