25 search results - page 3 / 5 » Handling Non-linear Polynomial Queries over Dynamic Data |
SCCC
2003
IEEE
14 years 29 days ago
2003
IEEE
The Dynamic Spatial Approximation Tree (dsa–tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alte...
AICT
2006
IEEE
13 years 11 months ago
2006
IEEE
We present NetTraveler a database middleware system for WANs that is designed to efficiently run queries over sites that are either mobile clients or enterprise servers. NetTravel...
ICDE
2007
IEEE
14 years 2 months ago
2007
IEEE
Partitioned query processing is an effective method to process continuous queries with large stateful operators in a distributed systems. This method typically partitions input da...
DAMON
2006
Springer
13 years 11 months ago
2006
Springer
Hashing is one of the fundamental techniques used to implement query processing operators such as grouping, aggregation and join. This paper studies the interaction between modern...
PC
2007
13 years 7 months ago
2007
The convergence of the Grid and Peer-to-Peer (P2P) worlds has led to many solutions that try to efficiently solve the problem of resource discovery on Grids. Some of these solutio...