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

International Asia-Pacific Web Conference (APWEB)

作者： Yansong Zhang Shan Wang Wei Huang Key Laboratory of Ministry of Education of Data Engineering and Knowledge Engineering Beijing China School of Information Renmin University of China Beijing China

The requirements of OLAP applications increase rapidly by dramatically increased data volume, users, query volume and query complexity. The requirement for shortening update period in data warehouse is another crucial factor for a scalable OLAP application. In this paper, we propose a scalable OLAP prototype to support the query processing with increasing data volume by distributing the whole fact tuples to multiple servers to construct a set of sibling cubes which can be merged together to obtain the whole cube. We employ a light weight distribution policy with fully duplicated dimension tables in each sibling server on the observation of very low proportion of space cost for dimension tables. OLAP query with distributed aggregate functions can be transformed into queries to be performed parallel in sibling servers. For non-distributed computing aggregate functions, such as median, the optimized median aggregate computing algorithm is proposed to reduce transmission volume between servers while computing the global median values. We also present a three-level framework in data warehouse to meet the requirement of shorter update period in "operational business intelligence". An asynchronous tunnel model is proposed to reduce update latency by pre-fetching updated tuples to OLAP processing server. Finally, we set up prototype system ParaCube to evaluate performance in SN (shared-nothing) system and multi-core platforms.

关键词： Aggregates Distributed computing Concurrent computing data warehouses Merging Application software Prototypes Query processing Acceleration Material storage

来源：评论

学校读者我要写书评

暂无评论

Query-Aware Complex Object Buffer Management in XML information retrieval

Query-Aware Complex Object Buffer Management in XML Informat...

引用

International Asia-Pacific Web Conference (APWEB)

作者： Qiushi Li Qiuyue Wang Shan Wang Key Laboratory of Ministry of Education of Data Engineering and Knowledge Engineering Beijing China School of Information Renmin University of China Beijing China

In this paper, we analyse the data access characteristics of a typical XML information retrieval system and propose a new query aware buffer replacement algorithm based on prediction of Minimum Reuse Distance (MRD for short). The algorithm predicts an object's next reference distance according to the retrieval system's running status and replaces the objects that have maximum reuse distances. The factors considered in the replacement algorithm include the access frequency, creation cost, and size of objects, as well as the queries being executed. By taking into account the queries currently running or queuing in the system, MRD algorithm can predict more accurately the reuse distances of index data objects.

关键词： information management XML information retrieval Tree data structures Indexing Prediction algorithms Algorithm design and analysis Frequency data analysis information analysis

来源：评论

学校读者我要写书评

暂无评论

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

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.

关键词： Query-oriented XML Automatic summarization Corpus

来源：评论

学校读者我要写书评

暂无评论

Notice of Retraction: knowledge management technologies and applications: A literature review

Notice of Retraction: Knowledge management technologies and ...

引用

IEEE International Conference on Advanced Management Science (ICAMS)

作者： Xiaomi An Wang Wang Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China Beijing China School of Information Resource Management Renmin University of China Beijing China

This article has been retracted by the publisher.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Global Top-k aggregate queries based on x-tuple in uncertain database

Global Top-k aggregate queries based on x-tuple in uncertain...

引用

24th IEEE International Conference on Advanced information Networking and Applications Workshops, WAINA 2010

作者： Liu, Dexi Wan, Changxuan Xiong, Naixue Park, Jong Hyuk Yeoe, Sang-Soo School of Information Technology Jiangxi Key Laboratory of Data and Knowledge Engineering Jiangxi University of Finance and Economics Nanchang China Dept. of Computer Science Georgia State University Atlanta GA United States Dept. of Computer Science and Engineering Seoul National University of Technology Seoul Korea Republic of Division of Computer Engineering Mokwon University Daejeon Korea Republic of

ISBN: (纸本)9780769540191

A Top-k aggregate query, which is a powerful technique when dealing with large quantity of data, ranks groups of tuples by their aggregate values and returns k groups with the highest aggregate values. However, compared to Top-k in traditional databases, queries over uncertain database are more complicated because of the existence of exponential possible worlds. As a powerful semantic of Top-k in uncertain database, Global Top-k return k highest-ranked tuples according to their probabilities of being in the Top-k answers in possible worlds. We propose a x-tuple based method to process Global Top-k aggregate queries in uncertain database. Our method has two levels, group state generation and G-x-Top-k query processing. In the former level, group states, which satisfy the properties of x-tuple, are generated one after the other according to their aggregate values, while in the latter level, dynamic programming based Global x-tuple Top-k query processing are employed to return the answers. Comprehensive experiments on different data sets demonstrate the effectiveness of the proposed solutions. © 2010 IEEE.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

The Integrated Use of Business Continuity Management Systems, Records Management Systems and knowledge Management Systems

The Integrated Use of Business Continuity Management Systems...

引用

International Conference on Management and Service Science, MASS

作者： Xiaomi An Wang Wang Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education Renmin University of China Beijing China School of Information Resource Management Renmin University of China Beijing China

Much research has been done on integrated use of ISO management system standards. Integrated use of management systems is identified to have shared values of varied integration impacts on resources efficiency building and sustainable development of business processes. However, little research has been done on integrated use of business continuity management systems (BCMS), records management systems (RMS) and knowledge management systems (KMS). This paper proposes a holistic integration management approach for collaboration, optimization and innovation of the three management systems through mapping/building/operationalizing cycle for supply of efficiency building strategy to the dynamic accumulation, sharing, and exchanges of memory, evidence and knowledge of organization.

关键词： ISO standards Collaboration knowledge management Standards organizations Organizations

来源：评论

学校读者我要写书评

暂无评论

Study in retrieval visibility and optical thickness of fog with MODTRAN

Study in retrieval visibility and optical thickness of fog w...

引用

International Conference on Multimedia Technology

作者： Zhang, Wengang Wei, Ming Yu, Tao Wang, Gengke Lai, Jibao Wang, Yuqing Key Laboratory of Meteorological Disaster of Ministry of Education Earth System Remote Sensing Institute Nanjing University of Information Science and Technology Nanjing 210044 China Center for National Space-borne Demonstration Beijing 100101 China Institute of Data and Knowledge Engineering Henan University Kaifeng Henan 475001 China Binjiang College Nanjing University of Information Science and Technology Nanjing 210044 China

ISBN: (纸本)9781424478743

In recent years, many scientists have done some work in monitoring the fog, and achieved fruitful results. Now we want to conduct more in-depth study. In this paper, we utilize MODTRAN to simulate the relationship between transmittance and visibility, height of fog. By fitting the relationship between them, we get the formula that calculates visibility of fog using transmittance and height of fog. The correlation coefficient of this formula is very high, so it can be regarded as an accuracy one. The height of fog can be calculated by top temperature of fog, surface temperature and vertical lapse rate. The transmittance of the fog can be measured by using special instrument. Therefore, the visibility and optical thickness can be retrieved by this method. ©2010 IEEE.

关键词： Visibility

来源：评论

学校读者我要写书评

暂无评论

Performance study on logging to another main memory database

Performance study on logging to another main memory database

引用

International Conference on New Trends in information and Service Science, NISS

作者： Xiongpai Qin Xiaoyun Zhou Key Laboratory of Data Engineering and Knowledge Engineering School of Information Renmin University of China Beijing 100872 China Department of Computer Science and Technology Xuzhou Normal University Jiangsu 221008 China

In update intensive main memory database applications, huge volume of log records is generated, to maintain the ACID properties of the database system, the log records should be persistent efficiently. Delegating logging of one main memory database to another main memory database is proposed. The scheme is elaborated in detail in terms of architecture, logging & safeness levels, checkpointing, and recovery. Strict durability and relax durability are provided. When some form of non-volatile memory is used to temporarily holding log records, not only logging efficiency is improved, but also the scheme could guarantee full ACID of the system. We also propose using parallel logging to speedup log persistence by writing logs to multiple disks in parallel. Since interconnection network techniques progress by leaps and bounds, the scheme eliminates the concern about whether the system's overall performance may be slowed down by bandwidth and latency limitations. Experiment results demonstrate the feasibility of the proposal.

关键词： Checkpointing database systems Transaction databases Network servers Availability Nonvolatile memory Writing Communication industry Defense industry Wood industry

来源：评论

学校读者我要写书评

暂无评论

Two novel semantics of top-k queries processing in uncertain database

Two novel semantics of top-k queries processing in uncertain...

引用

10th IEEE International Conference on Computer and information Technology, CIT-2010, 7th IEEE International Conference on Embedded Software and Systems, ICESS-2010, 10th IEEE Int. Conf. Scalable Computing and Communications, ScalCom-2010

作者： Liu, Dexi Wan, Changxuan Xiong, N. Yang, Laurence T. Chen, Lei Jiangxi Key Laboratory of Data and Knowledge Engineering School of Information Technology Jiangxi University of Finance and Economics Nanchang China Department of Computer Science Georgia State University Atlanta GA United States Department of Computer Science St. Francis Xavier University Antigonish NS Canada Department of Computer Science HK University of Science and Technology Hong Kong Hong Kong

ISBN: (纸本)9780769541082

Top-k query is a powerful technique in uncertain databases because of the existence of exponential possible worlds, and it is necessary to combine score and confidence of tuples to derive top k answers. Different semantics, the combination methods of score and confidence, lead to different results. U-kRanks and Global Top-k are two semantics of Topk queries in uncertain database, which consider every alternative in x-tuple as single one and return the tuple which has the highest probability appearing at top k or a given rank. However, no matter which alternative (tuple) of an x-tuple appears in a possible world, it undoubtedly believes that this xtuple appears in the same possible world accordingly. Thus, instead of ranking every individual tuple, we define two novel Top-k queries semantics in uncertain database, Uncertain xkRanks queries (U-x-kRanks) and Global x-Top-k queries (Gx- Top-k), which return k entities according to the score and the confidence of alternatives in x-tuple, respectively. In order to reduce the search space, we present an efficient algorithm to process U-x-kRanks queries and G-x-Top-k queries. Comprehensive experiments on different data sets demonstrate the effectiveness of the proposed solutions. © 2010 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：