扫兴 发表于 2025-3-26 22:59:52
http://reply.papertrans.cn/27/2636/263514/263514_31.pngIntruder 发表于 2025-3-27 04:20:53
http://reply.papertrans.cn/27/2636/263514/263514_32.pngCondense 发表于 2025-3-27 07:43:13
http://reply.papertrans.cn/27/2636/263514/263514_33.pngcountenance 发表于 2025-3-27 11:13:25
http://reply.papertrans.cn/27/2636/263514/263514_34.png不真 发表于 2025-3-27 16:07:24
http://reply.papertrans.cn/27/2636/263514/263514_35.pngpropose 发表于 2025-3-27 18:58:24
http://reply.papertrans.cn/27/2636/263514/263514_36.pngAVERT 发表于 2025-3-28 00:24:54
http://reply.papertrans.cn/27/2636/263514/263514_37.pngbioavailability 发表于 2025-3-28 05:51:32
Relational Index Support for XPath Axesuilt on top of the B.-tree which is available in practically all commercial relational database systems. For most of the basic axis steps, we are able to derive theoretical worst case execution time bounds. We also perform experimental evaluation to substantiate those bounds.掺和 发表于 2025-3-28 06:40:26
Supporting XPath Axes with Relational Databases Using a Proxy Indexor any other XML query language, the relational schema must allow fast retrieval of the parents, children, ancestors, or descendants of a given set of nodes. Most of the previous work has aimed at this goal using pre-/postorder encoding. Relying on this method, however, may lead to scalability problabsolve 发表于 2025-3-28 13:17:35
http://reply.papertrans.cn/27/2636/263514/263514_40.png