检索结果-内蒙古大学图书馆

1st International Workshop on Graph database, IWGD 2010, 1st International Workshop on Advanced Techniques on XML data Management, XMLDM 2010, 2nd International Workshop on WCMT 2010, Held in Conj. with WAIM 2010

作者： Zhang, Song Du, Xiaoyong Key Lab. of Data Engineering and Knowledge Engineering School of Information Renmin University of China China

ISBN: (纸本)3642167195

keyword search is a proven, user-friendly way to query html documents in the World Wide Web. With the trend of integrating IR technologies into DB community, state-of-the-art studies have introduced keyword search into XML and relation. In this paper we introduce keyword search into a new circumstance called XRC (XML and relation co-occurrence) where XML and relational data exist at the same storage. By exploring semantic relationships between data from relation and XML, we enable users who intend to visit data from XML and relation to access information in an easier manner. To achieve this target, we propose a novel operation called XRCJ which connects data from XML and relation together when answering search query. We also improve traditional inverted index and design a mixed inverted index. Through conducting extensive experiments on synthetic data from real data set DBLP, we find that our method can achieve a good performance in XML and relation co-occurrence circumstance. © 2010 Springer-Verlag.

关键词： XML

来源：评论

学校读者我要写书评

暂无评论

Managing a large shared bank of unstructured data by using free-table

Managing a large shared bank of unstructured data by using f...

引用

12th International Asia Pacific Web Conference, APWeb 2010

作者： Zhang, Xiao Du, Xiaoyong Chen, Jinchuan Wang, Shan Renming University of China Key Lab. of Data Engineering and Knowledge Engineerging MOE China 59 Zhongguancun Street Beijing China

ISBN: (纸本)9780769540122

This paper presents a reference framework, called BUD, to manage a large shared bank of unstructured data. This paper lists several important issues on managing or maintaining the unstructured data in BUD. BUD stores and manages the ever-growing unstructured data by introducing a novel technique called free-table, which is a conceptual view for endusers and a physical entity maintained by transactional storage manager of BUD. Free-table is cell-oriented but not columnoriented as relational table. It can store various types of unstructured data in cell with different versions. Additionally, we study two cases, VMP and PXRDB, to show that our proposal is feasible and tractable. © 2010 IEEE.

关键词： Digital storage

来源：评论

学校读者我要写书评

暂无评论

Parallel SimRank computation on large graphs with iterative aggregation

Parallel SimRank computation on large graphs with iterative ...

引用

16th ACM SIGKDD International Conference on knowledge Discovery and data Mining, KDD-2010

作者： He, Guoming Feng, Haijun Li, Cuiping Chen, Hong Key Lab. of Data Engineering and Knowledge Engineering of Ministry of Education China Department of Computer Science Renmin University of China China No. 59 Zhongguancun Street Haidian District Beijing China

ISBN: (纸本)9781450300551

Recently there has been a lot of interest in graph-based analysis. One of the most important aspects of graph-based analysis is to measure similarity between nodes in a graph. SimRank is a simple and influential measure of this kind, based on a solid graph theoretical model. However, existing methods on SimRank computation suffer from two limitations: 1) the computing cost can be very high in practice;and 2) they can only be applied on static graphs. In this paper, we exploit the inherent parallelism and high memory bandwidth of graphics processing units (GPU) to accelerate the computation of SimRank on large graphs. Furthermore, based on the observation that SimRank is essentially a first-order Markov Chain, we propose to utilize the iterative aggregation techniques for uncoupling Markov chains to compute SimRank scores in parallel for large graphs. The iterative aggregation method can be applied on dynamic graphs. Moreover, it can handle not only the link-updating problem but also the node-updating problem. Extensive experiments on synthetic and real data sets verify that the proposed methods are efficient and effective. © 2010 ACM.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

An algorithm on the mining of batch processing process

An algorithm on the mining of batch processing process

引用

International Conference on Computational Science and engineering

作者： Wen, Yiping Liu, Jianxun Chen, Zhigang Key Lab. of Knowledge Processing and Networked Manufacturing Hunan University of Science and Technology Hunan China School of Information Science and Engineering Central South University Changsha China

ISBN: (纸本)9780769543239

Batch processing process denotes the process used in the workflow management systems (WfMSs) supporting dynamic batch processing. During the run time of their concurrent process instances, multiple activity cases of the same type may be vertically combined together according to some batch logics and submitted for execution as a whole. Therefore, it is necessary to study the actual way process instances are executed. In this paper, we propose an algorithm to mine batch processing process from system logs. A case study is also done to illustrate its effectiveness. © 2010 IEEE.

关键词： Workflow management

来源：评论

学校读者我要写书评

暂无评论

Discovering batch processing area from workflow logs

Discovering batch processing area from workflow logs

引用

International Conference on Computational Science and engineering

ISBN: (纸本)9780769543239

Our previous work has preliminarily investigated the batch processing model and its implementation. To solve the problem of setting batch processing areas for the applications of batch processing in workflow, this paper proposes a method of discovering batch processing area from workflow logs. Its mining process includes phrases of mining initial workflow model, identifying batch processing feature of activity and discovering batch processing area in the initial workflow model. The result of simulation experiments shows that this method can work effectively for several different size of data sets. © 2010 IEEE.

关键词： Batch data processing

来源：评论

学校读者我要写书评

暂无评论

Ubiquitous data

Ubiquitous data

引用

作者： Hotho, Andreas Pedersen, Rasmus Ulslev Wurst, Michael University Kassel Depart. of Electrical Engineering/Computer Science Knowledge and Data Engineering Group Germany Copenhagen Business School Dept. of Informatics Embedded Software Lab. Copenhagen Denmark Technical University Dortmund Computer Science LS8 44221 Dortmund Germany

ISBN: (纸本)3642163912

Ubiquitous knowledge discovery systems must be captured from many different perspectives. In earlier chapters, aspects like machine learning, underlying network technologies etc. were described. An essential component, which we shall discuss now, is still missing: Ubiquitous data. While data themselves are a central part of the knowledge discovery process, in a ubiquitous setting new challenges arise. In this context, the emergence of data itself plays a large role, therefore we lab.l this part of KDubiq systems ubiquitous data. It clarifies the KDubiq challenges related to the multitude of availab.e data and what we must do before we can tap into this rich information source. © 2010 Springer-Verlag.

关键词： Taps

来源：评论

学校读者我要写书评

暂无评论

Hierarchical certificateless signatures

Hierarchical certificateless signatures

引用

International Workshop on Wireless Network Algorithm and Theory

作者： Zhang, Lei Wu, Qianhong Domingo-Ferrer, Josep Qin, Bo UNESCO in Data Privacy Department of Computer Engineering and Mathematics Universitat Rovira i Virgili Catalonia Spain Wuhan University School of Computer Key Lab. of Aerospace Information Security and Trusted Computing China Xi'an University of Technology School of Science Department of Maths China

ISBN: (纸本)9780769543222

Certificateless cryptography eliminates the key escrow problem in identity-based cryptography. Hierarchical cryptography exploits a practical security model to mirror the organizational hierarchy in the real world. In this paper, to incorporate the advantages of both types of cryptosystems, we instantiate hierarchical certificateless cryptography by formalizing the notion of hierarchical certificateless signatures. Furthermore, we propose an HCLS scheme which, under the hardness of the computational Diffie-Hellman (CDH) problem, is proven to be existentially unforgeable against adaptive chosen-message attacks in the random oracle model. As to efficiency, our scheme has constant complexity, regardless of the depth of the hierarchy. Hence, the proposal is secure and scalab.e for practical applications. © 2010 IEEE.

关键词： Network security

来源：评论

学校读者我要写书评

暂无评论

Approximation algorithm for constructing data aggregation trees for wireless sensor networks

引用

中国高等学校学术文摘·计算机科学 2009年第4期3卷 524-534页

作者： Deying LI Jiannong CAO Qinghua ZHU Key Laboratory of Data Engineering and Knowledge Engineering School of InformationRenmin University of ChinaBeijing 100872China Internet and Mobile Computing Lab Department of ComputingHong Kong Polytechnic UniversityHong KongChina

This paper considers the problem of constructing data aggregation trees in wireless sensor networks (WSNs)for a group of sensor nodes to send collected information to a single sink *** data aggregation tree contains the sink node,all the source nodes,and some other non-source *** goal of constructing such a data aggregation tree is to minimize the number of non-source nodes to be included in the tree so as to save *** prove that the data aggregation tree problem is NP-hard and then propose an approximation algorithm with a performance ratio of four and a greedy *** also give a distributed version of the approximation *** simulations are performed to study the performance of the proposed *** results show that the proposed algorithms can find a tree of a good approximation to the optimal tree and has a high degree of scalab.lity.

关键词： WSNs data aggregation tree approximation algorithm distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Region extreme value query in sensor networks

Region extreme value query in sensor networks

引用

6th International Conference on Fuzzy Systems and knowledge Discovery, FSKD 2009

作者： Wu, Zhongbo Chen, Hong School of Information Renmin University of China Beijing 100872 China MOE Key Lab. of Data Engineering and Knowledge Engineering Beijing 100872 China

ISBN: (纸本)9780769537351

Existing research on extreme value query in wireless sensor networks is mainly focus on finding out sensors with highest metric. Yet in most actually scenarios, people cares more about special network regions than detailed metric of some single nodes. We put forward region extreme query in sensor networks which don't consider a sensor node but a region as query unit. We formally define region extreme value query and discuss how they can be expressed using the SQL. Then we devise a distributed algorithm named DCA for in-network evaluation of region extreme value query in dynamic region, aiming at the minimization of power consumption. Experiments show that DCA has good performance. © 2009 IEEE.

关键词： Sensor nodes

来源：评论

学校读者我要写书评

暂无评论

Efficient Computation of Reverse Skyline on data Stream

Efficient Computation of Reverse Skyline on Data Stream

引用

The Second International Joint Conference on Computational Science and Optimization(CSO 2009)(2009 国际计算科学与优化会议)

作者： Ling Zhu Cuiping Li Hong Chen School of Information Renmin University of China Key Lab of Data Engineering and Knowledge Engineering of MOE

Reverse Skyline Queries have been proved very useful in business location, environmental monitoring and some other applications. In this paper, we consider reverse skyline queries processing on data stream, which provides continuous, high-speed data elements. Specifically, we consider the latest objects in the sliding window. The challenge is that it is difficult to maintain a multidimensional index (for example, R-tree) in a dynamic dataset. Focusing on this challenge, we propose an algorithm with a DC-Tree as index and effective pruning methods to reduce the search space of query processing and the cost of index maintaining. Extensive experiments show that our algorithms are efficient and effective for on-line reverse skyline query.

关键词： Monitoring Query processing Costs data engineering knowledge engineering Multidimensional systems

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：