707 search results - page 127 / 142 » Processing queries on tree-structured data efficiently |
181
click to vote
ICDE
2006
IEEE
15 years 11 months ago
2006
IEEE
We consider the problem of creating a sample view of a database table. A sample view is an indexed, materialized view that permits efficient sampling from an arbitrary range query...
SIGMOD
2004
ACM
15 years 10 months ago
2004
ACM
Massive-scale self-administered networks like Peer-to-Peer and Sensor Networks have data distributed across thousands of participant hosts. These networks are highly dynamic with ...
CIKM
2006
Springer
15 years 1 months ago
2006
Springer
In this paper we introduce the distributed spatio-temporal similarity search problem: given a query trajectory Q, we want to find the trajectories that follow a motion similar to ...
JIDM
2010
14 years 8 months ago
2010
Because XML documents tend to be very large and are more and more collaboratively processed, their fine-grained storage and management is a must for which, in turn, a flexible tree...
CAD
2004
Springer
14 years 9 months ago
2004
Springer
We address the problem of representing and processing 3D objects, described through simplicial meshes, which consist of parts of mixed dimensions, and with a non-manifold topology...