1263 search results - page 179 / 253 » A Scalable Algorithm for Answering Queries Using Views |
126
Voted
DAGSTUHL
2004
15 years 4 months ago
2004
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...
108
click to vote
DEXA
2009
Springer
15 years 9 months ago
2009
Springer
SHIRI 1 is an ontology-based system for integration of semistructured documents related to a specific domain. The system’s purpose is to allow users to access to relevant parts ...
123
Voted
BMCBI
2010
15 years 2 months ago
2010
Background: The evolution of high throughput technologies that measure gene expression levels has created a data base for inferring GRNs (a process also known as reverse engineeri...
125
Voted
COMPGEOM
2003
ACM
15 years 7 months ago
2003
ACM
We develop cache-oblivious data structures for orthogonal range searching, the problem of finding all T points in a set of N points in Êd lying in a query hyper-rectangle. Cache...
125
click to vote
KDD
2005
ACM
16 years 3 months ago
2005
ACM
Redescription mining is a newly introduced data mining problem that seeks to find subsets of data that afford multiple definitions. It can be viewed as a generalization of associa...