146 search results - page 29 / 30 » ViST: A Dynamic Index Method for Querying XML Data by Tree S... |
CIKM
2005
Springer
13 years 11 months ago
2005
Springer
Testing reachability between nodes in a graph is a well-known problem with many important applications, including knowledge representation, program analysis, and more recently, bi...
JIIS
2002
13 years 5 months ago
2002
Although computer speed has steadily increased and memory is getting cheaper, the need for storage managers to deal efficiently with applications that cannot be held into main memo...
DNIS
2005
Springer
13 years 11 months ago
2005
Springer
: A Peer-to-peer Data Network (PDN) is an open and evolving society of peer nodes that assemble into a network to share their data for mutual benefit. PDNs are enabled by distribu...
CPM
2006
Springer
13 years 9 months ago
2006
Springer
The Range-Minimum-Query-Problem is to preprocess an array such that the position of the minimum element between two specified indices can be obtained efficiently. We present a dire...
SIGMOD
2006
ACM
14 years 5 months ago
2006
ACM
Given a dataset P and a preference function f, a top-k query retrieves the k tuples in P with the highest scores according to f. Even though the problem is well-studied in convent...