找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Database Systems for Advanced Applications; 14th International C Xiaofang Zhou,Haruo Yokota,Qing Liu Conference proceedings 2009 Springer-V

[复制链接]
楼主: Prehypertension
发表于 2025-3-26 23:18:20 | 显示全部楼层
发表于 2025-3-27 03:08:47 | 显示全部楼层
A Uniform Framework for Ad-Hoc Indexes to Answer Reachability Queries on Large Graphsosed to the entire graph. (2) We propose a heuristic algorithm to partition a given graph into subgraphs for indexing. (3) We demonstrate how reachability queries are evaluated in the graph framework. Our preliminary experimental results showed that the framework yields a smaller total index size an
发表于 2025-3-27 09:10:35 | 显示全部楼层
Top-K Correlation Sub-graph Search in Graph DatabasesP-CGSearch efficiently, we develop a .... algorithm (that is PG-search algorithm) and utilize graph indexing methods to speed up the mining task. Extensive experiment results evaluate the efficiency of our methods.
发表于 2025-3-27 09:38:31 | 显示全部楼层
A Reprocessing Model Based on Continuous Queries for Writing Data to RFID Tag Memorye tag stream continuously and finds unsure tags efficiently. We also discuss implementation issues for the proposed model. This shows that the reprocessing model processes unsuccessful operations completely and avoids inconsistent data, despite volatile characteristics in the RF communications.
发表于 2025-3-27 15:10:58 | 显示全部楼层
Recasting the Factories after the Warertain data for other query types. Extensive experiments have demonstrated the efficiency and effectiveness of our proposed approaches over both real and synthetic data sets, under various experimental settings.
发表于 2025-3-27 21:32:07 | 显示全部楼层
发表于 2025-3-28 00:20:54 | 显示全部楼层
发表于 2025-3-28 02:31:58 | 显示全部楼层
https://doi.org/10.1057/9781137089212osed to the entire graph. (2) We propose a heuristic algorithm to partition a given graph into subgraphs for indexing. (3) We demonstrate how reachability queries are evaluated in the graph framework. Our preliminary experimental results showed that the framework yields a smaller total index size an
发表于 2025-3-28 09:05:14 | 显示全部楼层
Governing Globality for Market FreedomP-CGSearch efficiently, we develop a .... algorithm (that is PG-search algorithm) and utilize graph indexing methods to speed up the mining task. Extensive experiment results evaluate the efficiency of our methods.
发表于 2025-3-28 12:00:45 | 显示全部楼层
Palgrave Advances in Behavioral Economicse tag stream continuously and finds unsure tags efficiently. We also discuss implementation issues for the proposed model. This shows that the reprocessing model processes unsuccessful operations completely and avoids inconsistent data, despite volatile characteristics in the RF communications.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-24 11:27
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表