1890 search results - page 189 / 378 » Querying Big Data by Accessing Small Data |
CGF
2002
14 years 11 months ago
2002
BSP trees and KD trees are fundamental data structures for collision detection in walkthrough environments. A basic issue in the construction of these hierarchical data structures...
WEBI
2005
Springer
15 years 5 months ago
2005
Springer
This paper addresses the adaptation of dynamic and synchronized multimedia presentations built by querying XML compatible data sources. We provide WIS designers with facilities fo...
118
click to vote
TODS
2002
14 years 11 months ago
2002
Metric access methods (MAMs), such as the M-tree, are powerful index structures for supporting ty queries on metric spaces, which represent a common abstraction for those searchin...
134
click to vote
DEXA
2009
Springer
15 years 3 months ago
2009
Springer
Data intensive applications in Life Sciences extensively use the Hidden Web as a platform for information sharing. Access to these heterogeneous Hidden Web resources is limited thr...
199
click to vote
ICDE
2009
IEEE
16 years 1 months ago
2009
IEEE
Due to the structural heterogeneity of XML, queries are often interpreted approximately. This is achieved by relaxing the query and ranking the results based on their relevance to ...