Sciweavers

807 search results - page 50 / 162
» Space Efficient Algorithms for Ordered Tree Comparison
Sort
View
VLDB
2004
ACM
127views Database» more  VLDB 2004»
16 years 4 months ago
Querying high-dimensional data in single-dimensional space
In this paper, we propose a new tunable index scheme, called iMinMax(), that maps points in highdimensional spaces to single-dimensional values determined by their maximum or minim...
Cui Yu, Stéphane Bressan, Beng Chin Ooi, Kian-Lee...
APNOMS
2006
Springer
15 years 7 months ago
On the Security of Attribute Certificate Structuring for Highly Distributed Computing Environments
For an efficient role based access control using attribute certificate in highly distributed computing environments, we use a technique of structuring role specification certificat...
Soomi Yang
ICC
2007
IEEE
174views Communications» more  ICC 2007»
15 years 10 months ago
Fairness Improvement and Efficient Rerouting in Mobile Ad Hoc Networks
— Mobile ad hoc networking allows nodes to form temporary networks and communicate with each other possibly via multiple hops. By using a special node called the gateway, an ad h...
Norihiro Ohata, Yongbing Zhang, Yusheng Ji, Xuemin...
DBA
2004
111views Database» more  DBA 2004»
15 years 5 months ago
Effective Decompositioning of Complex Spatial Objects into Intervals
In order to guarantee efficient query processing together with industrial strength, spatial index structures have to be integrated into fully-fledged object-relational database ma...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
CIKM
2004
Springer
15 years 9 months ago
Using a compact tree to index and query XML data
Indexing XML is crucial for efficient XML query processing. We propose a compact tree (Ctree) for XML indexing, which provides not only concise path summaries at group level but a...
Qinghua Zou, Shaorong Liu, Wesley W. Chu