Temporal databases: theory, design, and implementation
Temporal databases: theory, design, and implementation
ACM SIGMOD Record
Principles of distributed database systems (2nd ed.)
Principles of distributed database systems (2nd ed.)
Six degree-of-freedom haptic rendering using voxel sampling
Proceedings of the 26th annual conference on Computer graphics and interactive techniques
Advances in Distributed and Parallel Knowledge Discovery
Advances in Distributed and Parallel Knowledge Discovery
Efficient Indexing for Constraint and Temporal Databases
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Interval Sequences: An Object-Relational Approach to Manage Spatial Data
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Spatial Query Processing for High Resolutions
DASFAA '03 Proceedings of the Eighth International Conference on Database Systems for Advanced Applications
Joining interval data in relational databases
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
| Hi-index | 0.00 |
In many different application areas, e.g. space observation systems or engineering systems of world-wide operating companies, there is a need for an ef ficient distributed intersection join in order to extract new and global knowledge. A solution for carrying out a global intersection join is to transmit all distributed information from the clients to a central server leading to high transfer cost. In this paper, we present a new distributed intersection join for interval sequences of high-cardinality which tries to minimize these transmission cost. Our approach is based on a suitable probability model for interval intersections which is used on the server as well as on the various clients. On the client sites, we group intervals together based on this probability model. These locally created approximations are sent to the server. The server ranks all intersecting approximations according to our probability model. As not all approximations have to be refined in order to decide whether two objects intersect, we fetch the exact information of the most promising approximations first. This strategy helps to cut down the transmission cost considerably which is proven by our experimental evaluation based on syn thetic and real-world test data sets.