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

DSI: A Model for distributed Multimedia Semantic indexing and Content Integration

ACM TRANSACTIONS ON MULTIMEDIA COMPUTING COMMUNICATIONS AND APPLICATIONS 2010年第1期6卷 1–21页

作者： Yang, Bo Bowie State Univ Dept Comp Sci Bowie MD 20715 USA

Considerable research has been done on the content-based multimedia delivery and access in distributed data repositories. As noted in the literature, there is always a trade-off between multimedia quality and access speed. In addition, the overall performance is greatly determined by the distribution of the multimedia data. In this article, an unsupervised multimedia semantic integration approach for a distributed infrastructure, the distributed Semantic indexing (DSI), is presented that addresses both the data quality and search performance. With the ability of summarizing content information and guiding data distribution, the proposed approach is distinguished by: (1) logic-based representation and concise abstraction of the semantic contents of multimedia data, which are further integrated to form a general overview of a multimedia data repository-content signature;(2) application of linguistic relationships to construct a hierarchical metadata based on the content signatures allowing imprecise queries;and (3) achieving the optimal performance in terms of search cost. The fundamental structure of the proposed model is presented. The proposed scheme has been simulated and the simulation results are analyzed and compared against several other approaches that have been advocated in the literature.

关键词： Design Algorithms Experimentation Human Factors Semantic representation image retrieval distributed indexing

来源：评论

学校读者我要写书评

暂无评论

The Internet Pilot to Physics: An open information system for physics research and education

引用

INTERNATIONAL JOURNAL OF MODERN PHYSICS C 1997年第1期8卷 3-17页

作者： Karttunen, M Holmlund, K Nowotny, G MCGILL UNIV CTR PHYS MATMONTREALPQ H3A 2T8CANADA UMEA UNIV DEPT THEORET PHYSS-90187 UMEASWEDEN VIENNA TECH UNIV INST THEORET PHYSA-1040 VIENNAAUSTRIA

In this article we discuss the effort made by the Internet Pilot to Physics (TIPTOP) project to develop a uniform and open information infrastructure for physics research and education. We discuss concepts such as communication in research and education, the importance of distributed indexing and catalogs, and briefly the use of new technology such as VRML and Java. We also stress the importance of developing and using standardized protocols and formats such as the Summary Object Interchangeable Format (SOIF) and Thematic Uniform Resource Agents (TURA). TIPTOP has rapidly grown to be one of the most popular physics Internet knowledge servers, and the recently established collaboration with the European Physical Society is an important step forward in developing a stable framework of high quality information for researchers and educators.

关键词： physics information systems information infrastructure distributed indexing

来源：评论

学校读者我要写书评

暂无评论

Scalable Decentralized indexing and Querying of Multi-Streams in the Fog

引用

JOURNAL OF GRID COMPUTING 2020年第3期18卷 395-418页

作者： Dazzi, Patrizio Mordacchini, Matteo ISTI CNR Pisa Italy IIT CNR Pisa Italy

NOA-AID (Network Overlays for Adaptive information Aggregation, indexing and Discovery on the fog) is an approach for decentralized indexing, aggregation and discovery of data belonging to streams. It is organized on two network layers. The upper layer is in charge of delivering an information discovery approach by providing a distributed index structure. The lower layer is devoted to resource aggregation based on epidemic protocols designed for highly dynamic environment, well suited to stream-oriented scenarios. It defines a flexible approach to express queries targeting highly heterogeneous data, as well as a self-organizing dynamic system allowing the optimal resolution of queries on the most suitable stream producers. The paper also presents a theoretical study and discusses the costs related to information management operations;it also gives an empirical validation of findings. Finally, it reports an extended experimental evaluation that demonstrated the ability of NOA-AID to be effective and efficient for retrieving information extracted from streams in highly-dynamic and distributed processing architectures.

关键词： Streaming Network protocols distributed indexing Community detection

来源：评论

学校读者我要写书评

暂无评论

Enabling Web Services to Consume and Produce Large Datasets

引用

IEEE INTERNET COMPUTING 2012年第1期16卷 52-60页

作者： Koulouzis, Spiros Cushing, Reginald Karasavvas, Konstantinos A. Belloum, Adam Bubak, Marian Univ Amsterdam Dept Comp Sci NL-1012 WX Amsterdam Netherlands Univ Amsterdam Inst Informat NL-1012 WX Amsterdam Netherlands

Service-oriented architectures and Web services are well-established paradigms for developing distributed applications. However, Web services face problems when accessing, moving, and processing large datasets. To address this problem, the authors present ProxyWS, which uses myriad protocols to transport large amounts of data. ProxyWS undertakes data transfers on behalf of legacy Web services and can serve as an interface for developing new Web services that can stream data. Experiments show how this approach facilitates scalable data transports for two data-intensive applications.

关键词： Data Intensive Applications SOA Web Services Data Transfers distributed indexing

来源：评论

学校读者我要写书评

暂无评论

Customized information extraction as a basis for resource discovery

引用

ACM TRANSACTIONS ON COMPUTER SYSTEMS 1996年第2期14卷 171-199页

作者： Hardy, DR Schwartz, MF UNIV COLORADO BOULDERCO

indexing file contents is a powerful means of helping users locate documents, software, and other types of data among large repositories. In environments that contain many different types of data, content indexing requires type-specific processing to extract information effectively. We present a model for type-specific, user-customizable information extraction, and a system implementation called Essence, This software structure allows users to associate specialized extraction methods with ordinary files, providing the illusion of an object-oriented file system that encapsulates indexing methods within files. By exploiting the semantics of common file types, Essence generates compact yet representative file summaries that can be used to improve both browsing and indexing in resource discovery systems. Essence can extract information from most of the types of files found in common file systems, including files with nested structure (such as compressed ''tar'' files). Essence interoperates with a number of different search/index systems (such as WAIS and Glimpse), as part of the Harvest system.

关键词： experimentation measurement distributed indexing Internet resource discovery

来源：评论

学校读者我要写书评

暂无评论

An adaptive access method for broadcast data under an error-prone mobile environment

引用

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 2000年第4期12卷 609-620页

作者： Lo, SC Chen, ALP Natl Tsing Hua Univ Dept Comp Sci Hsinchu 300 Taiwan

A ubiquitous information environment can be achieved by the mobile computing technologies. In this environment, users carrying their portable computers can retrieve local or remote information anywhere and at anytime. Data broadcast, with its advantages, has become a powerful means to disseminate data in wireless communications. indexing methods for the broadcast data have been proposed to speedup access time and reduce power consumption. However, the influence of access failures has not been discussed. For the error-prone mobile environment, the occurrence of access failures is often due to disconnections, handoffs, and communication noises. In this paper, based on the distributed indexing scheme, we propose an adaptive access method which tolerates the access failures. The basic idea is to use index replication to recover from the access failures. One mechanism, named search range, is provided to dynamically record the range where the desired data item may exist. According to the search range, an unfinished search can be efficiently resumed by finding an available index replicate. A performance analysis is given to show the benefits of the method. Also, the concept of version bits is applied to deal with the updates of the broadcast data.

关键词： mobile computing data broadcast distributed indexing power saving handoff fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Building a distributed full-text index for the Web

引用

ACM TRANSACTIONS ON INFORMATION SYSTEMS 2001年第3期19卷 217-241页

作者： Melnik, S Raghavan, S Yang, B Garcia-Molina, H Stanford Univ Gates Comp Sci Dept Stanford CA 94305 USA

We identify crucial design issues in building a distributed inverted index for a large collection of Web pages. We introduce a novel pipelining technique for structuring the core index-building system that substantially reduces the index construction time. We also propose a storage scheme for creating and managing inverted files using an embedded database system. We suggest and compare different strategies fur collecting global statistics from distributed inverted indexes. Finally, we present performance results from experiments on a testbed distributed Web indexing system that we have implemented.

关键词： design performance distributed indexing text retrieval inverted files pipelining embedded databases

来源：评论

学校读者我要写书评

暂无评论

SSW: A small-world-based overlay for peer-to-peer search

引用

IEEE TRANSACTIONS ON PARALLEL AND distributed SYSTEMS 2008年第6期19卷 735-749页

作者： Li, Mei Lee, Wang-Chien Sivasubramaniam, Anand Zhao, Jing Microsoft Corp Redmond WA 98052 USA Penn State Univ Dept Comp Sci & Engn University Pk PA 16802 USA Hong Kong Univ Sci & Technol Dept Comp Sci & Engn Kowloon Hong Kong Peoples R China

Peer-to-peer (P2P) systems have become a popular platform for sharing and exchanging voluminous information among thousands or even millions of users. The massive amount of information shared in such systems mandates efficient semantic-based search instead of key-based search. The majority of existing proposals can only support simple key-based search rather than semantic-based search. This paper presents the design of an overlay network, namely, semantic small world (SSW), that facilitates efficient semantic-based search in P2P systems. SSW achieves the efficiency based on four ideas: 1) semantic clustering, where peers with similar semantics organize into peer clusters, 2) dimension reduction, where to address the high maintenance overhead associated with capturing high-dimensional data semantics in the overlay, peer clusters are adaptively mapped to a one-dimensional naming space, 3) small world network, where peer clusters form into a one-dimensional small world network, which is search efficient with low maintenance overhead, and 4) efficient search algorithms, where peers perform efficient semantic-based search, including approximate point query and range query in the proposed overlay. Extensive experiments using both synthetic data and real data demonstrate that SSW is superior to the state of the art on various aspects, including scalability, maintenance overhead, adaptivity to distribution of data and locality of interest, resilience to peer failures, load balancing, and efficiency in support of various types of queries on data objects with high dimensions.

关键词： distributed systems distributed indexing overlay Internet content sharing peer-to-peer systems

来源：评论

学校读者我要写书评

暂无评论

Optimizing Big Data Retrieval and Job Scheduling Using Deep Learning Approaches

引用

Computer Modeling in Engineering & Sciences 2023年第2期134卷 783-815页

作者： Bao Rong Chang Hsiu-Fen Tsai Yu-Chieh Lin Department of Computer Science and Information Engineering National University of KaohsiungKaohsiungTaiwan Department of Fragrance and Cosmetic Science Kaohsiung Medical UniversityKaohsiungTaiwan

Big data analytics in business intelligence do not provide effective data retrieval methods and job scheduling that will cause execution inefficiency and low system *** paper aims to enhance the capability of data retrieval and job scheduling to speed up the operation of big data analytics to overcome inefficiency and low throughput ***,integrating stacked sparse autoencoder and Elasticsearch indexing explored fast data searching and distributed indexing,which reduces the search scope of the database and dramatically speeds up data ***,exploiting a deep neural network to predict the approximate execution time of a job gives prioritized job scheduling based on the shortest job first,which reduces the average waiting time of job *** a result,the proposed data retrieval approach outperforms the previous method using a deep autoencoder and Solr indexing,significantly improving the speed of data retrieval up to 53%and increasing system throughput by 53%.On the other hand,the proposed job scheduling algorithmdefeats both first-in-first-out andmemory-sensitive heterogeneous early finish time scheduling algorithms,effectively shortening the average waiting time up to 5%and average weighted turnaround time by 19%,respectively.

关键词： Stacked sparse autoencoder Elasticsearch distributed indexing data retrieval deep neural network job scheduling

来源：评论

学校读者我要写书评

暂无评论

ECHO: Efficient Complex Query over DHT Overlays

引用

JOURNAL OF PARALLEL AND distributed COMPUTING 2016年 88卷 31-45页

作者： Hidalgo, Nicolas Arantes, Luciana Sens, Pierre Bonnaire, Xavier Univ Santiago Santiago Chile Univ Paris 06 CNRS INRIA LIP6 Paris France Univ Tecn Federico Santa Maria Dept Comp Sci Valparaiso Chile

In this article we propose ECHO, a novel and lightweight solution that efficiently supports range queries over a ring-like distributed Hash Table (DHT) structure. By implementing a tree-based index structure and an effective query routing strategy, ECHO provides low-latency and low-overhead query searches by exploiting the Tabu Search principle. Load balancing is also improved reducing the traditional bottleneck problems arising in upper level nodes of tree-based index structures such as PHT. Furthermore, ECHO copes with DHT churn problems as its index exploits logical information as opposed to static reference cache approaches or replication techniques. The performance evaluation results obtained using PeerSim simulator show that ECHO achieves efficient performance compared other solutions such as the PHI strategy and its optimized version which includes a query cache. (C) 2015 Elsevier Inc. All rights reserved.

关键词： Peer-to-peer DHT Range queries Prefix trees distributed indexing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：