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

11th International Reasoning Web Summer School (RW)

作者： Mileo, Alessandra Natl Univ Ireland Univ Coll Galway Insight Ctr Data Analyt Galway Ireland

ISBN: (纸本)9783319217680;9783319217673

A fast growing torrent of data is being created by companies, social networks, mobile phones, smart homes, public transport vehicles, healthcare devices, and other modern infrastructures. Being able to unlock the potential hidden in this torrent of data would open unprecedented opportunities to improve our daily lives that were not possible before. Advances in the Internet of Things (IoT), Semantic Web and Linked Data research and standardization have already established formats and technologies for representing, sharing and re-using (dynamic) knowledge on the Web. However, transforming data into actionable knowledge requires to cater for (i) automatic mechanisms to discover and integrate heterogeneous data streams on the fly and extract patterns for applications to use, (ii) concepts and algorithms for context and quality-aware integration of semantic data streams, and (iii) the ability to synthesize domain-driven commonsense knowledge (and answers derived from it) with expressive inference that can capture decision analytics in a scalable way. In the first part of this lecture we will characterize the main approaches to stream processing for the Web of Data, showing how data quality and context can guide semantic integration. In the second part of this lecture we will focus on rule-based Web Stream Reasoning and illustrate how scalability and uncertainty issues can be addressed in a rule-based approach. We will discuss new challenges and opportunities in Web Stream Reasoning, briefly considering economical and societal impact in real application scenarios in a smart city context, and we will conclude by providing a brief overview of ongoing research and standardization activities in this area.

关键词： Stream reasoning continuous query processing Quality of information Logic programming Semantic web Inductive logic reasoning

来源：评论

学校读者我要写书评

暂无评论

RSP-QL Semantics: A Unifying query Model to Explain Heterogeneity of RDF Stream processing Systems

引用

INTERNATIONAL JOURNAL ON SEMANTIC WEB AND INFORMATION SYSTEMS 2014年第4期10卷 17-44页

作者： Dell'Aglio, Daniele Della Valle, Emanuele Calbimonte, Jean-Paul Corcho, Oscar Politecn Milan Dipartimento Elettron Informaz & Bioingn I-20133 Milan Italy Ecole Polytech Fed Lausanne Distributed Informat Syst Lab Lausanne Switzerland Univ Politecn Madrid Ontol Engn Grp Madrid Spain

RDF and SPARQL are established standards for data interchange and querying on the Web. While they have been shown to be useful and applicable in many scenarios, they are not sufficiently adequate for dealing with streams of data and their intrinsic continuous nature. In the last years data and query languages have been proposed to extend both RDF and SPARQL for streams and continuous processing, under the name of RDF Stream processing - RSP. These efforts resulted in several models and implementations that, at a first look, appear to propose alternative syntaxes but equivalent semantics. However, when asked to continuously answer the same queries on the same data streams, they provide different answers at disparate moments due to the heterogeneity of their operational semantics. These discrepancies render the process of understanding and comparing continuous query results complex and misleading. In this work, the authors propose RSP-QL, a comprehensive model that formally defines the semantics of an RSP system. RSP-QL makes explicit the hidden assumptions of currently available RSP systems, allows defining a formal notion of correctness for RSP query results and, thus, explains why available implementations provide different answers at disparate moments.

关键词： Conceptual Model continuous query processing Correctness RDF Streams RSP-QL Semantics

来源：评论

学校读者我要写书评

暂无评论

A First Look at Caching during TIP-tree Navigation for Location Based Services

A First Look at Caching during TIP-tree Navigation for Locat...

引用

28th IEEE International Conference on Advanced Information Networking and Applications Workshops (IEEE WAINA)

作者： Osborn, Wendy Univ Lethbridge Dept Math & Comp Sci Lethbridge AB T1K 3M4 Canada

ISBN: (纸本)9781479926527

This paper explores the issue of caching during TIP-tree navigation for location-based services. The TIP-tree is a recently proposed spatial access method for supporting continuous point queries in a tourist information system. In addition, its navigation strategy avoids repeating searching, thus providing efficient processing of user trajectories that are not known in advance. This paper proposes a caching strategy that further improves upon the efficiency of the TIP-tree navigation algorithm. A performance evaluation shows that significant improvement is possible when navigation and caching are applied together.

关键词： location-based services spatial access method continuous query processing navigation

来源：评论

学校读者我要写书评

暂无评论

continuous query processing over music streams based on approximate matching mechanisms

引用

MULTIMEDIA SYSTEMS 2008年第1期14卷 51-70页

作者： Chen, Hung-Chen Wu, Yi-Hung Soo, Yu-Chi Chen, Arbee L. P. Natl Chengchi Univ Dept Comp Sci Taipei 11605 Taiwan Natl Tsing Hua Univ Dept Comp Sci Hsinchu 30013 Taiwan Chung Yuan Christian Univ Dept Informat & Comp Engn Chungli 32023 Taiwan

It is foreseen that more and more music objects in symbolic format and multimedia objects, such as audio, video, or lyrics, integrated with symbolic music representation (SMR) will be published and broadcasted via the Internet. The SMRs of the flowing songs or multimedia objects will form a music stream. Many interesting applications based on music streams, such as interactive music tutorials, distance music education, and similar theme searching, make the research of content-based retrieval over music streams much important. We consider multiple queries with error tolerances over music streams and address the issue of approximate matching in this environment. We propose a novel approach to continuously process multiple queries over the music streams for finding all the music segments that are similar to the queries. Our approach is based on the concept of n-grams, and two mechanisms are designed to reduce the heavy computation of approximate matching. One mechanism uses the clustering of query n-grams to prune the query n-grams that are irrelevant to the incoming data n-gram. The other mechanism records the data n-gram that matches a query n-gram as a partial answer and incrementally merges the partial answers of the same query. We implement a prototype system for experiments in which songs in the MIDI format are continuously broadcasted, and the user can specify musical segments as queries to monitor the music streams. Experiment results show the effectiveness and efficiency of the proposed approach.

关键词： music stream continuous query processing event stream approximate matching lower bounding

来源：评论

学校读者我要写书评

暂无评论

A New Operator for Efficient Stream-Relation Join processing in Data Streaming Engines 13

A New Operator for Efficient Stream-Relation Join Processing...

引用

22nd ACM International Conference on Information and Knowledge Management (CIKM)

作者： Derakhshan, Roozbeh Sattar, Abdul Stantic, Bela Griffith Univ Inst Integrated & Intelligent Syst Brisbane Qld Australia NICTA Queensland Res Lab Brisbane Qld Australia

ISBN: (纸本)9781450322638

In the last decade, Stream processing Engines (SPEs) have emerged as a new processing paradigm that can process huge amounts of data while retaining low latency and high-throughputs. Yet, it is often necessary to join streaming data with traditional databases to provide more contextual information for the end-users and applications. The major problem that we confront is to join the fast arriving stream tuples with the static relation tuples that are on a slow database. This is what we call the Stream-Relation Join (SRJ) problem. Currently, SPEs use a naive tuple-by-tuple approach for SRJ processing where the SPE accesses the database for every incoming tuple. Some SPEs use cache to avoid accessing the database for every incoming tuple. while others do not because of the stochastic nature of streaming data. In this paper, we propose a new SRJ operator to facilitate SRJ processing regardless of the cache performance using two techniques: batching and out-of-order processing. The proposed operator provides an effective generic solution to the SRJ problem and the cost of incorporating our operator into different SPEs is minimal. Our experiments use a variety of synthetic and real data sets demonstrating that our operator outperforms the state-of-the-art tuple-by-tuple approach in terms of maximizing the throughput under ordering and memory constraints.

关键词： Stream Data processing continuous query processing Stream-Relation Join processing

来源：评论

学校读者我要写书评

暂无评论

Localized and Incremental Monitoring of Reverse Nearest Neighbor Queries in Wireless Sensor Networks

引用

JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 2012年第6期28卷 1105-1128页

作者： Mai, Hai Thanh Kim, Myoung Ho Korea Adv Inst Sci & Technol Dept Comp Sci Taejon 305701 South Korea

Reverse nearest neighbor (RNN) monitoring queries are useful in many object tracking scenarios using wireless sensor networks. However, there is still no research work addressing RNN monitoring queries in this environment. In addition, even though some algorithms have been proposed to process RNN monitoring queries in other environments, they are not quite appropriate for wireless sensor networks. The reason is that these algorithms all adopt centralized processing which requires all object locations sent to a central server to be processed further, thus exhausts quickly the sensor nodes limited power. Therefore, in this paper, we study the problem of processing RNN monitoring queries in wireless sensor networks. We consider both two cases of RNN monitoring queries, namely monochromatic and bichromatic, and develop for each case a localized and incremental monitoring algorithm. Our main ideas are to localize the searching task to only relevant sensor nodes near the query point and to establish and incrementally maintain some restricted monitoring areas for each query. During the major part of the query lifetime, only object location updates from these areas instead of the whole space need to be collected and processed. Extensive experimental results show that the proposed algorithms are scalable and an order of magnitude more efficient than the centralized ones in terms of energy consumption.

关键词： distributed database wireless sensor network continuous query processing reverse nearest neighbor query monitoring algorithm

来源：评论

学校读者我要写书评

暂无评论

Prediction of bus motion and continuous query processing for traveler information services

引用

11th East European Conference on Advances in Databases and Information Systems

作者： Predic, Bratislav Stojanovic, Dragan Djordjevic-Kajan, Slobodanka Milosavljevic, Aleksandar Rancic, Dejan Univ Nis Fac Elect Engn Nish 18000 Serbia

ISBN: (纸本)9783540751847

The paper presents the methods for prediction of bus arrival times and continuous query processing as foundations of traveler information services. The time series of data from automatic vehicle location (AVL) system, consisting of time, location and speed data, is used with historical statistics and bus schedule information to predict future arrivals and motion. Based on predicted and AVL data, continuous query processing technique is proposed to extend traveler information service with notification/alarm features. Extensive experiments have shown that the proposed algorithm for bus motion prediction is efficient enough to function in real conditions and that augmented with continuous query processing techniques can produce services that useful to the travelers.

关键词： automatic Vehicle Location (AVL) prediction of arrival/travel time continuous query processing information services intelligent transportation systems (ITS)

来源：评论

学校读者我要写书评

暂无评论

Multilevel secure data stream processing: Architecture and implementation

引用

JOURNAL OF COMPUTER SECURITY 2012年第5期20卷 547-581页

作者： Adaikkalavan, Raman Xie, Xing Ray, Indrakshi Indiana Univ Comp & Informat Sci South Bend IN 46634 USA Colorado State Univ Comp Sci Ft Collins CO 80523 USA

The proliferation of sensors and mobile devices and their connectedness to the network have given rise to numerous types of situation monitoring applications. Data Stream Management Systems (DSMSs) have been proposed to address the data processing needs of such applications that require collection of high-speed data, computing results on-the-fly, and taking actions in real-time. Although a lot of work appears in the area of DSMS, not much has been done in multilevel secure (MLS) DSMS making the technology unsuitable for highly sensitive applications, such as battlefield monitoring. An MLS-DSMS should ensure the absence of illegal information flow in a DSMS and more importantly provide the performance needed to handle continuous queries. We illustrate why the traditional DSMSs cannot be used for processing multilevel secure continuous queries and discuss various DSMS architectures for processing such queries. We implement one such architecture and demonstrate how it processes continuous queries. In order to provide better quality of service and memory usage in a DSMS, we show how continuous queries submitted by various users can be shared. We provide experimental evaluations to demonstrate the performance benefits achieved through query sharing.

关键词： Multilevel security DSMS continuous query processing

来源：评论

学校读者我要写书评

暂无评论

On Efficient and Scalable Support of continuous Queries in Mobile Peer-to-Peer Environments

引用

IEEE TRANSACTIONS ON MOBILE COMPUTING 2011年第10期10卷 1473-1487页

作者： Chow, Chi-Yin Mokbel, Mohamed F. Leong, Hong Va City Univ Hong Kong Dept Comp Sci Kowloon Hong Kong Peoples R China Univ Minnesota Twin Cities Dept Comp Sci & Engn Minneapolis MN 55455 USA Hong Kong Polytech Univ Dept Comp Kowloon Hong Kong Peoples R China

In this paper, we propose an efficient and scalable query processing framework for continuous spatial queries (range and k-nearest-neighbor queries) in mobile peer-to-peer (P2P) environments, where no fixed communication infrastructure or centralized/distributed servers are available. Due to the limitations in mobile P2P environments, for example, user mobility, limited battery power, limited communication range, and scarce communication bandwidth, it is costly to maintain the exact answer of continuous spatial queries. To this end, our framework enables the user to find an approximate answer with quality guarantees. In particular, we design two key features to adapt continuous spatial query processing to mobile P2P environments. 1) Each mobile user can specify his or her desired quality of services (QoS) for a query answer in a personalized QoS profile. The QoS profile consists of two parameters, namely, coverage and accuracy. The coverage parameter indicates the desired level of completeness of the available information for computing an approximate answer, and the accuracy parameter indicates the desired level of accuracy of the approximate answer. 2) We design a continuous answer maintenance scheme to enable the user to collaborate with other peers to continuously maintain a query answer. With these two features in our framework, the user can obtain a query answer from a local cache if the answer satisfies his or her QoS requirements. Otherwise, the user enlists neighbors for help to share their cached information to refine the answer. If the refined answer still cannot satisfy the QoS requirements, the user broadcasts the query to the peers residing within the required search area of the query to find the most accurate answer. Experiment results show that our framework is efficient and scalable and provides an effective trade-off between the communication overhead and the quality of query answers.

关键词： Mobile computing peer-to-peer computing continuous query processing spatio-temporal databases GIS

来源：评论

学校读者我要写书评

暂无评论

Multilevel Secure Data Stream processing

Multilevel Secure Data Stream Processing

引用

25th Annual IFIP WG 11.3 Conference on Data and Applications Security and Privacy (DBSec)

作者： Adaikkalavan, Raman Ray, Indrakshi Xie, Xing Indiana Univ Comput & Informat Sci South Bend IN 46615 USA Colorado State Univ Comp Sci Colorado Springs CO USA

ISBN: (纸本)9783642223471;9783642223488

With sensors and mobile devices becoming ubiquitous, situation monitoring applications are becoming a reality. Data Stream Management Systems (DSMSs) have been proposed to address the data processing needs of such applications that require collection of high-speed data, computing results on-the-fly, and taking actions in real-time. Although a lot of work appears in the area of DSMS, not much has been done in multilevel secure (MLS) DSMS making the technology unsuitable for highly sensitive applications such as battlefield monitoring. An MLS DSMS should ensure the absence of illegal information flow in a DSMS and more importantly provide the performance needed to handle continuous queries. We investigate the issues important in an MLS DSMS and propose an architecture that best meets the goals of MLS DSMS. We discuss how continuous queries can be executed in such a system and sharing across queries accomplished for maximum performance benefits.

关键词： Multilevel Security DSMS continuous query processing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：