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

Large scale report generation in data consolidation environments of banks

Huazhong Keji Daxue Xuebao (Ziran Kexue Ban)/Journal of Huazhong University of Science and Technology (Natural Science Edition) 2012年第SUPPL.1期40卷 5-8页

作者： Qin, Xiongpai Zhou, Xiaoyun Wu, Zhongxin Yang, Hongzhi Wang, Wei Ministry of Education Key Lab of Data Engineering and Knowledge Engineering Renmin University of China Beijing 100872 China Information School Renmin University of China Beijing 100872 China Computer Science Department Jiangsu Normal University Xuzhou 221116 Jiangsu China Beijing Nantian Software Co. Ltd. Beijing 100085 China

To generate large number of reports in a limited time window, four techniques were proposed, including ROLAP&SQL, Shared Scanning, Hadoop based Solution, and MOLAP&Cube Sharding, an algorithm that performs in memory aggregation was designed for the second solution. The experiment results show that all techniques except ROLAP&SQL can meet the time window constraint, the Hadoop based solution is a promising technique owe to its highly scalability. Considering maturity of the techniques and their performance, we put MOLAP&Cube Sharding into practice while keeping an eye on Hadoop for future adoption.

关键词： Custom report data consolidation Hadoop Large bank MOLAP ROLAP

来源：评论

学校读者我要写书评

暂无评论

Probabilistic range queries for Uncertain Trajectories on road networks 11

Probabilistic range queries for Uncertain Trajectories on ro...

引用

14th International Conference on Extending database Technology: Advances in database Technology, EDBT 2011

作者： Zheng, Kai Trajcevski, Goce Zhou, Xiaofang Scheuermann, Peter School of ITEE University of Queensland Australia Department of EECS Northwestern University United States School of Information Renmin University of China Key Lab. of Data Engineering and Knowledge Engineering Ministry of Education China

ISBN: (纸本)9781450305280

Trajectories representing the motion of moving objects are typically obtained via location sampling, e.g. using GPS or road-side sensors, at discrete time-instants. In-between consecutive samples, nothing is known about the whereabouts of a given moving object. Various models have been proposed (e.g., sheared cylinders;spacetime prisms) to represent the uncertainty of the moving objects both in unconstrained Euclidian space, as well as road networks. In this paper, we focus on representing the uncertainty of the objects moving along road networks as time-dependent probability distribution functions, assuming availability of a maximal speed on each road segment. For these settings, we introduce a novel indexing mechanism - UTH (Uncertain Trajectories Hierarchy), based upon which efficient algorithms for processing spatio-temporal range queries are proposed. We also present experimental results that demonstrate the benefits of our proposed methodologies.

关键词： Trajectories

来源：评论

学校读者我要写书评

暂无评论

A RFID Mixed Coding Scheme Based on Huffman Algorithm

A RFID Mixed Coding Scheme Based on Huffman Algorithm

引用

International Conference on Management of e-Commerce and e-Government, ICMECG

作者： Jiang Jian Liao Guoqiong Wang Hao Wan Qizhi School of Information Technology Jiangxi university of Finance and Economics China Jiangxi Key Laboratory of Data and Knowledge Engineering Nanchang Nanchang China

In RFID application systems with multiple packaging layers, labeling packaging relationship of objects in different packaging layers by encoding methods is a important technology field. Prefix-based labeling scheme is a method by which the packaging relationship of objects amounts to testing whether one object is an prefix of the other, whereas the region numbering scheme is a method by which an ancestor query amount to an interval containment test on the labels. This paper first presents a mixed-encoding scheme based on Huffman algorithm, then propose a variant of this encoding scheme in which new "virtual nodes" are involved in order to improve the stability of encoding. Our experiments prove that the mixed-based encoding scheme is effective due to the enhancement of update performance and query efficiency.

关键词： Encoding labeling Radiofrequency identification XML Algorithm design and analysis Testing

来源：评论

学校读者我要写书评

暂无评论

A Query-Oriented Summarization System for XML Elements

A Query-Oriented Summarization System for XML Elements

引用

International Conference on Management of e-Commerce and e-Government, ICMECG

作者： Dexi Liu Shihan Wu Jiangxi Key Laboratory of Data and Knowledge Engineering Jiangxi University of Finance and Economics Nanchang China Songjiang Branch of Shanghai Rural Commercial Bank Shanghai China

In document-center XML dataset, an element may contain so many text that users have to spend enough time to judge the elements returned by XML search engine are valuable or not. Query-orient XML summarization system aim to provide users a brief and readable substitution of the original retrieved elements according to the user's query, which can relieve user's reading burden effectively. In this work, we extract sentences from the results of XML search engine, and combine them as a summary. Experiments on the IEEE-CS datasets used in INEX show that, the query-oriented XML summary generated by our method is reasonable.

关键词： XML Feature extraction Sections Search engines Computational modeling Electronic mail

来源：评论

学校读者我要写书评

暂无评论

Constructing corpus for query-oriented XML text summarization

Constructing corpus for query-oriented XML text summarizatio...

引用

International Conference on Management of E-Commerce and E-Goverment

作者： Wu, Shihan Liu, Dexi Jiao, Xianpei Jiangxi Key Laboratory of Data and Knowledge Engineering School of Information Technology Jiangxi University of Finance and Economics Nanchang Jiangxi China

ISBN: (纸本)9780769542454

XML Retrieval is becoming the focus study of the field of Information Retrieval and database. Summarization of the results which come from the XML search engines will alleviate the read burden of user's. However, as the basis of this study, the construction of the query-oriented XML text summarization corpus has not yet received enough attention. In this paper, we introduce our works on constructing this kind of corpus, including the selection of topics and XML elements/documents, construction process and the feature of the constructed corpus. Up to now, the corpus has 25 English query topics, including 422 elements for summarization, and 32 Chinese topics which including 402 elements. For each topic, 4 pieces of extracted summaries and 4 pieces of generated summaries are made manually by 4 experts. © 2010 IEEE.

关键词： XML

来源：评论

学校读者我要写书评

暂无评论

XRCJ: Supporting keyword search in XML and relation co-occurrence

XRCJ: Supporting keyword search in XML and relation co-occur...

引用

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

来源：评论

学校读者我要写书评

暂无评论

Constructing Corpus for Query-oriented XML Text Summarization

Constructing Corpus for Query-oriented XML Text Summarizatio...

引用

2010 International Conference on Management of e-Commerce and e-Government(第四届电子商务与电子政务管理国际会议 ICMeCG 2010)

作者： Shihan WU Dexi LIU Xianpei JIAO Jiangxi Key Laboratory of Data and Knowledge Engineering School of Information Technology Jiangxi University of Finance & Economics Nanchang Jiangxi China

关键词： Query-oriented XML Automatic summarization Corpus

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Pseudo-relevance feedback driven for XML query expansion

引用

Journal of Convergence Information Technology 2010年第9期5卷 146-156页

作者： Minjuan, Zhong Changxuan, Wan School of Information Technology Jiangxi University of Finance and Economics Nanchang 330013 China Jiangxi Key Laboratory of Data and Knowledge Engineering Jiangxi University of Finance and Economics Nanchang 330013 China

Pseudo-relevance feedback has been perceived as an effective solution for automatic query expansion. However, a recent study has shown that traditional pseudo-relevance feedback may bring into topic drift and hence be harmful to the retrieval performance. It is often crucial to identify those good feedback documents from which useful expansion terms can be added to the query. Compared with traditional query expansion, XML query expansion needs not only content expansion but also considering structural expansion. This paper presents a solution for both identifying related documents and selecting good expansion information with new content and path constrains. Combined with XML semantic feature, a naïve document similarity measurement is proposed in this paper. Based on this, k-median clustering algorithm is firstly implemented and some related documents are found. Secondly, query expansion is only performed by two steps in the set of related documents, which key phrase extraction algorithm is carried out to expand original query in the first step and the second step is structural expansion based on the expanded key phrases. Finally a full-edged content-structure query expression which can represent user's intention is formalized. Experimental results on IEEE CS collection show that the proposed method can reduce the topic drift effectively and obtain the better retrieval quality.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：