591 search results - page 98 / 119 » The complexity of XPath query evaluation |
SARA
2007
Springer
14 years 2 months ago
2007
Springer
Constraint Programming is a powerful approach for modeling and solving many combinatorial problems, scalability, however, remains an issue in . Abstraction and reformulation techni...
TOOLS
2000
IEEE
14 years 29 days 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...
PODS
2000
ACM
14 years 5 days ago
2000
ACM
In this paper, we propose a new tunable index scheme, called iMinMax , that maps points in high dimensional spaces to single dimension values determined by their maximum or minimu...
AMR
2008
Springer
13 years 10 months ago
2008
Springer
Retrieving music from large digital databases is a demanding computational task. The cost for indexing and searching depends not only on the computational effort of measuring music...
SEBD
1997
13 years 10 months ago
1997
M-tree is a dynamic access method suitable to index generic “metric spaces”, where the function used to compute the distance between any two objects satisfies the positivity, ...