11213 search results - page 312 / 2243 » Low-contention data structures |
148
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
A data structure, called a biased range tree, is presented that preprocesses a set S of n points in R2 and a query distribution D for 2-sided orthogonal range counting queries. The...
184
click to vote
WISE
2002
Springer
15 years 11 months ago
2002
Springer
—Knowledge inference from semi-structured data can utilize frequent sub structures, in addition to frequency of data items. In fact, the working assumption of the present study i...
182
click to vote
TOOLS
2000
IEEE
15 years 11 months ago
2000
IEEE
Many data objects in the real world have attributes about location and time. Such spatiotemporal objects can be found in applications such Geographic Information Systems (GIS), env...
179
click to vote
WWW
2006
ACM
16 years 7 months ago
2006
ACM
In this paper, we proposed an online algorithm, called FQT-Stream (Frequent Query Trees of Streams), to mine the set of all frequent tree patterns over a continuous XML data strea...
176
click to vote
IPPS
1997
IEEE
15 years 11 months ago
1997
IEEE
We propose a distributed data structure for maintaining spatial data sets on message-passing, distributed memory machines. The data structure is based on orthogonal bisection tree...