2217 search results - page 287 / 444 » Rank-aware Query Optimization |
181
click to vote
STOC
2002
ACM
16 years 6 months ago
2002
ACM
We present improved algorithms for maintaining transitive closure and all-pairs shortest paths/distances in a digraph under deletion of edges. For the problem of transitive closur...
195
click to vote
SSDBM
1999
IEEE
15 years 10 months ago
1999
IEEE
Large scale data analysis and mining activities, such as identifying interesting trends, making unusual patterns to stand out and verifying hypotheses, require sophisticated infor...
177
click to vote
DASFAA
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract. In this paper, we present a novel ordered XPATH evaluation in treeunaware RDBMS. The novelties of our approach lies in the followings. (a) We propose a novel XML storage ...
157
click to vote
ESWS
2008
Springer
15 years 8 months ago
2008
Springer
The goal of this paper is to give an overview of the basics of the theory of RDF databases. We provide a formal definition of RDF that includes the features that distinguish this m...
200
click to vote
ALENEX
2001
15 years 7 months ago
2001
In nearest neighbor searching we are given a set of n data points in real d-dimensional space, d , and the problem is to preprocess these points into a data structure, so that give...