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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

9 篇 会议

馆藏范围

9 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

7 篇 工学
- 7 篇 计算机科学与技术...
- 2 篇 电气工程
- 2 篇 控制科学与工程
- 1 篇 信息与通信工程
- 1 篇 软件工程
1 篇 法学
- 1 篇 社会学
1 篇 教育学
- 1 篇 教育学

主题

9 篇 xml data streams
3 篇 forward xpath
3 篇 normalization
2 篇 medical biology
2 篇 xml filtering
1 篇 filters
1 篇 xml
1 篇 lower bound
1 篇 pervasive comput...
1 篇 buffer reduction
1 篇 keyword search
1 篇 aslca
1 篇 xml compression
1 篇 xml prefiltering
1 篇 xml message diss...
1 篇 compact lowest c...
1 篇 xquery
1 篇 maximum containe...
1 篇 xsd
1 篇 slca

机构

2 篇 shandong univ de...
2 篇 natl univ def te...
1 篇 univ paderborn e...
1 篇 swinburne univ t...
1 篇 colorado state u...
1 篇 department of ea...
1 篇 university of pa...
1 篇 college of compu...
1 篇 anna univ dept i...
1 篇 shandong univ we...
1 篇 anhui wenda info...
1 篇 univ western aus...
1 篇 school of comput...
1 篇 univ western aus...
1 篇 college of compu...
1 篇 zhejiang univ de...
1 篇 department of co...
1 篇 swinburne univ t...

作者

3 篇 yang chi
3 篇 yang zhimin
2 篇 qiao lixiang
2 篇 liu chang
2 篇 ren kaijun
1 篇 wang jing
1 篇 stefan böttcher
1 篇 kaijun ren
1 篇 rita hartel
1 篇 chang liu
1 篇 le yu
1 篇 xuejiao li
1 篇 chi yang
1 篇 senthilkumar rad...
1 篇 hartel rita
1 篇 belyaev kirill
1 篇 ray indrakshi
1 篇 jianqiao yu
1 篇 heinzemann chris...
1 篇 zhimin yang

语言

9 篇 英文

检索条件"主题词=XML Data Streams"

共 9 条记录，以下是1-10 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Towards Efficient Dissemination and Filtering of xml data streams 15

Towards Efficient Dissemination and Filtering of XML Data St...

引用

IEEE International Conference on Computer and Information

作者： Belyaev, Kirill Ray, Indrakshi Colorado State Univ Dept Comp Sci Ft Collins CO 80523 USA

ISBN: (纸本)9781509001545

The vast amounts of data generated in near real-time due to prolific use of sensors, pervasive usage of mobile Internet, and popularity of social media platforms, necessitates the efficient dissemination of the semi-structured streaming data to the consuming applications. Towards this end, we introduce the subscriber-centric xml filtering approach for seamless and efficient xml stream replication/distribution mechanism. The subscriber-centric filtering architecture can be configured to support different topologies in order to support efficient message filtering for a large number of concurrent subscribers. It allows selective filtering on the various nodes that improves efficiency and provides applications with data on a need-to-know basis. Moreover, it supports interoperability and allows semi-structured streams generated from multiple sources to be filtered. Our xml filtering network consists of decoupled data producers, message transformation agents and xml brokers that can be deployed in conventional data centers as well as in the public cloud environment. We provide detailed performance results of processing filtering queries in several use case scenarios with varying xml message loads and number of nodes involved in the replication/dissemination process. Our results indicate that the subscriber-centric xml filtering architecture is a viable approach for disseminating semi-structured data streams to the various consuming applications.

关键词： xml data streams xml filtering xml message dissemination

来源：评论

学校读者我要写书评

暂无评论

Forward XPath Rewriting over xml data streams

Forward XPath Rewriting over XML Data Streams

引用

IEEE International Symposium on IT in Medicine and Education

作者： Qiao, Lixiang Yang, Zhimin Yang, Chi Ren, Kaijun Yu, Le Liu, Chang Shandong Univ Weihai Dept Comp Weihai Peoples R China Univ Western Australia Sch Comp Sci & Software Engn Nedlands WA 6009 Australia Natl Univ Def Technol Coll Comp Changsha 410073 Peoples R China Swinburne Univ Technol CS3 Ctr Complex Software Syst & Serv Hawthorn Vic 3122 Australia Zhejiang Univ Dept Earth Sci Hangzhou 310027 Peoples R China

ISBN: (纸本)9781424439294

Streaming xml data is often encountered in applications in Medical Biology. So, how to effectively manage and query AML data streams can be a fundamental issue for the quality of those Medical Biology applications. With respect to current methods for XPath query evaluation over xml data streams, adoption of some query rewriting techniques are common when encountering some complex query which can cause ambiguities and redundant query cost. Lots of work can be found in database research community to simplify query and remove its redundancy. However less attention is paid to make use of query rewriting to benefit the query evaluation process of an efficient xml data stream query system. In other words, the query rewriting is not directly for the purpose of simplicity or redundancy removal;whereas it is for the convenience of an efficient query. In this paper, we propose a normalization process which rewrites the Forward XPath expressions for our xml data stream query system. The proposed normalization is expected to normalize all the complex predicates connected with logic operators into twig structures. With this normalization, queries can be transformed into a well-structured one, the formal way of the normalization makes the query language of our xml data stream query system more precise and the twig structure facilitates the query evaluation of our query system.

关键词： Normalization Forward XPath xml data streams Medical Biology

来源：评论

学校读者我要写书评

暂无评论

Normalization of the Forward XPath for Efficient Query Evaluation over xml data streams

Normalization of the Forward XPath for Efficient Query Evalu...

引用

Joint Conference on Pervasive Computing

作者： Qiao, Lixiang Yang, Zhimin Yang, Chi Ren, Kaijun Liu, Chang Shandong Univ Dept Comp Weihai Peoples R China Anhui Wenda Informat & Technol Coll Hefei Peoples R China Univ Western Australia Sch Comp Sci & Software Engn Perth WA 6009 Australia Natl Univ Def Technol Coll Comp Changsha Hunan 410073 Peoples R China

ISBN: (纸本)9781424452279

In pervasive computing applications, how to effectively manage and query xml data streams is an important issue. Particularly, query rewriting techniques for processing complex query which can cause ambiguities and redundant query cost, have been proposed to simplify query and remove its redundancy. However, less attention has been paid to make use of query rewriting to benefit the query evaluation process of an efficient xml data stream query system. In this paper, we propose a normalization process which rewrites the Forward XPath expressions for our xml data stream query system. The proposed normalization is expected to normalize all the complex predicates connected with logic operators into twig structures. As a result, the formal way of the normalization makes the query language of our xml data stream query system more precise and the generated twig structure facilitates the query evaluation of our query system.

关键词： Pervasive computing Normalization Forward XPath xml data streams

来源：评论

学校读者我要写书评

暂无评论

Forward XPath Rewriting over xml data streams

Forward XPath Rewriting over XML Data Streams

引用

2009 IEEE International Symposium on IT in Medicine & Education( IEEE 教育与医药信息化国际会议)

作者： Lixiang Qiao Zhimin Yang Chi Yang Chang Liu Kaijun Ren Le Yu Department of Computer Shandong Univisity at Weihai Weihai P.R.China School of Computer Science and Software Engineering The University of Western Australia Perth 35 College of Computer National University of Defense Technology Changsha Hunan410073 P.R.China CS Department of Earth Sciences Zhejiang University 38 Zheda Road Hangzhou310027 China

Streaming xml data is often encountered in applications in Medical Biology. So, how to effectively manage and query xml data streams can be a fundamental issue for the quality of those Medical Biology applications. With respect to current methods for XPath query evaluation over xml data streams, adoption of some query rewriting techniques are common when encountering some complex query which can cause ambiguities and redundant query cost. Lots of work can be found in database research community to simplify query and remove its redundancy. However, less attention is paid to make use of query rewriting to benefit the query evaluation process of an efficient xml data stream query system. In other words, the query rewriting is not directly for the purpose of simplicity or redundancy removal;whereas it is for the convenience of an efficient query. In this paper, we propose a normalization process which rewrites the Forward XPath expressions for our xml data stream query system. The proposed normalization is expected to normalize all the complex predicates connected with logic operators into twig structures. With this normalization, queries can be transformed into a well-structured one, the formal way of the normalization makes the query language of our xml data stream query system more precise and the twig structure facilitates the query evaluation of our query system.

关键词： Normalization Forward XPath xml data streams Medical Biology

来源：评论

学校读者我要写书评

暂无评论

Generating Relevant Paths Using Keyword Search on Compact xml

Generating Relevant Paths Using Keyword Search on Compact XM...

引用

International Conference on Recent Trends in Information Technology (ICRTIT)

作者： Meenakshi, S. Senthilkumar, Radha Anna Univ Dept Informat Technol Madras 600025 Tamil Nadu India

ISBN: (纸本)9781479910243

The management of xml data has always been a popular research issue. A simple yet effective way to search in xml database is keyword search. In existing methods, the user has to compose query with which the relevant answers can be retrieved. These methods require the user to have prior knowledge about the data. To overcome the issues arising out of these methods, several approaches have been proposed. In this paper, Two challenges for searching the keyword in xml document has been proposed;1) how to retrieve high answer semantics matches of the keyword queries (Top-k) 2) how to identify the relevant path for the keyword queries. To identify relevant answers over xml data streams, the Compact Lowest Common Ancestors (CLCAs) are used. We use a compact storage structure (QUICX) system which is efficient both in compression and storage with indexing features for efficient querying. Experiments were carried out using benchmark datasets such as geographical dataset (mondial) and bibliographic dataset (DBLP). In order to prove the effectiveness of the proposed system, it is compared against the existing system with respect to time taken for retrieval and the proposed system achieves about 63.3% of improvement over the keyword search in xml document in terms of time taken for retrieval.

关键词： TOP-K Keyword search Compact Lowest Common Ancestor (CLCAs) xml data streams

来源：评论

学校读者我要写书评

暂无评论

Multi-filters collaboration for querying xml data streams

Multi-filters collaboration for querying XML data streams

引用

12th International Conference on Computer Supported Cooperative Work in Design

作者： Yang, Zhimin Wang, Jing Yang, Chi Shandong Univ Dept Comp Weihai Peoples R China Swinburne Univ Technol Fac Informat & Commun Technol Hawthorn Vic 3122 Australia

ISBN: (纸本)9781424416509

Current methods for querying xml data streams are mostly based on events filtering techniques. It is unavoidable for the query systems to adopt an event filter to process the incoming xml tags. It is well known that during the filtering, some data items have to be buffered before the filter can make the proper decision for adopting strategies to deal with them. Furthermore, for a single filter system, the buffer size often increases exponentially in the real application. Lots of work both theoretically and empirically, has been done to dissolve or depress that exponential explosion, but it still remains an active research topic. Considering the fast development of computer supported collaboration, we propose a new multifilters collaborative querying technique to process xml data streams. We show that the multi-filters collaboration can effectively share and reduce the filtering space consumption if some xml document and query constraints can be satisfied. Deploying our multi-filters collaboration technique, the querying systems together can break the limitation of the concurrency lower bound, an important theoretic lower bound within xml data streams research field The empirical study shown in this paper demonstrates that our multi-filters collaboration outperforms the limitation of the concurrency lower bound.

关键词： xml data streams filters multi-filters collaboration SAX API buffer reduction lower bound

来源：评论

学校读者我要写书评

暂无评论

Efficient string-based xml stream prefiltering 12

Efficient string-based XML stream prefiltering

引用

Proceedings of the Twenty-Third Australasian database Conference - Volume 124

作者： Stefan Böttcher Rita Hartel Steffen Weber University of Paderborn (Germany) Fürstenallee Paderborn

ISBN: (纸本)9781921770050

Whenever huge xml documents have to be evaluated according to a given XPath or XQuery query, parsing the whole document in form of e. g. SAX events is the baseline that is common to all evaluators. But typically only few parts of the document are really relevant and can contribute to the query evaluation. We propose an approach to String-based prefiltering of an xml document D that outputs a smaller document D' that contains the relevant parts of the document, such that the query Q evaluated on D yields the same result as Q evaluated on D'. In contrast to previous approaches, our approach extends the idea of efficient String-based xml prefiltering with support for xml Schema instead of DTDs, recursive schemata, and attribute filters. Our experiments on a 1 GB XMark document, taking the average over 22 queries, have shown that our approach outperforms previous prefiltering approaches and that it reaches an average speed-up factor of 8 compared to XQuery evaluation without prefiltering.

关键词： xml filtering XPath xml prefiltering XQuery xml data streams xml XSD

来源：评论

学校读者我要写书评

暂无评论

An Algorithm of Keyword Queries over xml streams

An Algorithm of Keyword Queries over XML Streams

引用

The 6th International Forum on Strategic Technology(IFOST 2011)(第六届国际战略技术论坛)

作者： Jing Feng Jianqiao Yu Xuejiao Li College of Computer and Information Science Southwest UniversityChongqing China

ISBN: (纸本)9781457703980;9781457703966

The current forms of Keywords;search over xml data streams are mainly based on SLCA results, which are incompleteness. This paper addresses this problem in another aspect. In this paper, a novel definition of complete ASLCA based on SLCA results is proposed to represent all possible results in the query. A novel kind of query algorithm is proposed. Extensively theoretical analysis and experiments have been performed to verify the better time complexity, space complexity, and recall ratio of the algorithms presented in this study.

关键词： SLCA ASLCA maximum contained sequence xml data streams

来源：评论

学校读者我要写书评

暂无评论

BSBC:: Towards a succinct data format for xml streams

BSBC:: Towards a succinct data format for XML streams

引用

4th International Conference on Web Information Systems and Technologies

作者： Boettcher, Stefan Hartel, Rita Heinzemann, Christian Univ Paderborn EIM Elect Engn Comp Sci & Math D-33102 Paderborn Germany

ISBN: (纸本)9789898111265

xml data compression is an important feature in xml data exchange, particularly when the data size may cause bottlenecks or when bandwidth and energy consumption limitations require reducing the amount of the exchanged xml data. However, applications based on xml data streams also require efficient path query processing on the structure of compressed xml data streams. We present a succinct representation of xml data streams, called Bit-Stream-Based-Compression (BSBC) that fulfills these requirements and additionally provides a compression ratio that is significantly better than that of other queriable xml compression techniques, i.e. XGrind and DTD subtraction, and that of non-queriable compression techniques like gzip. Finally, we present an empirical evaluation comparing BSBC with these compression techniques and with XMill that demonstrates the benefits of BSBC.

关键词： xml compression xml data streams

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共1页 << < 1 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：