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

Fast query algorithm for social network data based on association features

JOURNAL OF INTELLIGENT & FUZZY SYSTEMS 2018年第4期35卷 4153-4162页

作者： Liu, Shuying Zou, Yanfei Terasvirta, A. M. Xianyang Normal Univ Sch Comp Sci Xianyang 712000 Peoples R China Zagazig Univ Fac Sci Dept Math Zagazig Egypt

The traditional data query algorithm based on clustering strategy library ignores the association features of social network data, characteristic data acquisition exist a large number of redundant features and frequent relationship among features is low, resulting in the social network data query efficiency and the accuracy is poor, so a fast query algorithm for social network data based on fuzzy degree function based on association features is proposed, it is based on Apriori algorithm for data association feature mining of social network to obtain the maximum frequent association feature set;for association feature preprocessing, it reduce the maximum frequent association feature set by feature dimension reduction and de redundancy algorithm, to obtain better social network maximal frequent associated feature set;when using fuzzy function to query social network data quickly, it uses data of a single gene ambiguity function to build a fast data query diagram, input the best frequent feature set of social network, and output the query results of social network data with the highest priority. The experimental results show that the proposed algorithm has the advantages of high efficiency and high accuracy in social network data query.

关键词： Association features apriori algorithm social network data data set maximum frequent association features ambiguity function query algorithm

来源：评论

学校读者我要写书评

暂无评论

A blockchain-based data storage architecture for Internet of Vehicles: Delay-aware consensus and data query algorithms

引用

VEHICULAR COMMUNICATIONS 2024年 47卷

作者： Ren, Zhiqiang Liu, Shumei An, Yisheng Li, Yonghui Wu, Naiqi Changan Univ Sch Informat Engn Xian 710021 Peoples R China Univ Sydney Sch Elect & Informat Engn Sydney NSW 2006 Australia Macau Univ Sci & Technol Inst Syst Engn Taipa 999078 Macau Peoples R China

The recent development of the Internet of Vehicles (IoV) relies heavily on the secure store and analysis of reliable driving data. Blockchain technology has been widely used in the IoV field due to its security advantages, where consensus and query algorithms are two key modules determining its performance. However, existing solutions do not perform well enough in terms of delay performance, thus limiting their ability to support IoV environments with ultra-low-latency requirements. To address this challenge, we design a blockchain-based data storage architecture, focusing on the design of delay-aware consensus and data query algorithms. Specifically, to reduce the consensus delay, we propose a reputation-assisted and grouping-simplified Practical Byzantine Fault Tolerant (RGS-PBFT) algorithm. First, we develop a novel node credit value evaluation model by combining the behavior and configuration reputation to select the primary node with both high security and high computing capacity. Second, after determining the primary node, we reduce the communication complexity of traditional 4 PBFT from O(Z(2)) to O(Z(4/3)) by establishing a grouping-simplified consensus structure. These contributions effectively reduce the consensus delay. To reduce the query delay and index construction time, we propose an index query algorithm based on the data tracking chain (DTC-Index query). By introducing the LevelDB database, it establishes a transaction index chain coupled to vehicle ID in the blockchain. This approach avoids the timeconsuming block traversal during data querying. Experimental results demonstrate that the proposed algorithms outperform existing solutions, achieving significant improvements in both consensus delay and query time reduction. Notably, our solutions offer exceptional delay performance, making them well-suited for IoV environments.

关键词： Internet of Vehicles (IoV) Blockchain Consensus algorithm Practical Byzantine Fault Tolerant (PBFT) query algorithm

来源：评论

学校读者我要写书评

暂无评论

Research on the Storage Management of Wireless Sensor Networks Based on query algorithm

Research on the Storage Management of Wireless Sensor Networ...

引用

2013 2nd International Conference on Mechanical Engineering,Industrial Electronics and Informatization(MEIEI 2013)

作者： He Pan Taihao Li zhigang Liu Information technology teaching and Management Center Jilin Agricultural University Key Laboratory of Mine Informatization Henan Polytechnic University

For the research of a query algorithm which is suitable for large-scale wireless sensor network should consider the energy consumption of nodes and the storage consumption of nodes. Through the simulation experiment of this algorithm can make the user adjust the merger rate according to the specific situation of network and the query,so as to ensure that the multiple queries in the processing are not affected by the limited cyber source.

关键词： Wireless sensor network Storage query algorithm

来源：评论

学校读者我要写书评

暂无评论

Distributed indexing and scalable query processing for interactive big data explorations

Distributed indexing and scalable query processing for inter...

引用

作者： Gheorghi Guzun University of Iowa

学位级别：博士

The past few years have brought a major surge in the volumes of collected data. More and more enterprises and research institutions find tremendous value in data analysis and exploration. Big Data analytics is used for improving customer experience, perform complex weather data integration and model prediction, as well as personalized medicine and many other services. Advances in technology, along with high interest in big data, can only increase the demand on data collection and mining in the years to come. As a result, and in order to keep up with the data volumes, data processing has become increasingly distributed. However, most of the distributed processing for large data is done by batch processing and interactive exploration is hardly an option. To efficiently support queries over large amounts of data, appropriate indexing mechanisms must be in place. This dissertation proposes an indexing and query processing framework that can run on top of a distributed computing engine, to support fast, interactive data explorations in data warehouses. Our data processing layer is built around bit-vector based indices. This type of indexing features fast bit-wise operations and scales up well for high dimensional data. Additionally, compression can be applied to reduce the index size, and thus utilize less memory and network communication. Our work can be divided into two areas: index compression and query processing. Two compression schemes are proposed for sparse and dense bit-vectors. The design of these encoding methods is hardware-driven, and the query processing is optimized for the available computing hardware. query algorithms are proposed for selection, aggregation, and other specialized queries. The query processing is supported on single machines, as well as computer clusters.

关键词： Bit-vector Database Indexing Data Compression Data Exploration Distributed Database query algorithm

来源：评论

学校读者我要写书评

暂无评论

Research on Optimized Spatial Data query algorithm in the Spatial Database

Research on Optimized Spatial Data Query Algorithm in the Sp...

引用

International Symposium on Image Analysis and Signal Processing

作者： Li, Guobin Wang, Guiling Henan Polytech Univ Sch Comp Sci & Technol Jiaozuo Peoples R China

ISBN: (纸本)9781424439867

Spatial objects are stored in the spatial database, which are expressed by spatial data and attribute data. Spatial data depicts the information about the location and shape of the spatial data, etc. Attribute data also expresses the non-spatial information about name and special attributes of the spatial object, etc. As the high volume of the spatial data and the complexity of spatial query and spatial objects, it is a hot topic of spatial database application to optimize the spatial query. This paper takes optimizing spatial data as study object, and optimizes the two handling processes of filtering and optimizing, and also study on all kinds of optimize algorithm.

关键词： spatial data query spatial objects spatial database query algorithm attribute data

来源：评论

学校读者我要写书评

暂无评论

Research on Optimized Spatial Data query algorithm in the Spatial Database

Research on Optimized Spatial Data Query Algorithm in the Sp...

引用

2009图像分析与信号处理国际会议(2009 International Conference on Image Analysis and Signal Processing)

作者： Guobin Li Guiling Wng School of Computer Science and Technology Henan Polytechnic University Jiaozuo China School of Computer Science and Technology Henan Polytechnic University Jiaozuo China University of

ISBN: (纸本)9781424439874

关键词： spatial data query spatial objects spatial database query algorithm attribute data

来源：评论

学校读者我要写书评

暂无评论

Revisiting Dynamic query Protocols in Unstructured Peer-to-Peer Networks

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2012年第1期23卷 160-167页

作者： Tian, Chen Jiang, Hongbo Liu, Xue Liu, Wenyu Huazhong Univ Sci & Technol Wuhan Natl Lab Optoelect Dept Elect & Informat Engn Wuhan 430074 Peoples R China Univ Nebraska Schorr Ctr 104 Lincoln NE 68588 USA

In unstructured peer-to-peer networks, the average response latency and traffic cost of a query are two main performance metrics. Controlled-flooding resource query algorithms are widely used in unstructured networks such as peer-to-peer networks. In this paper, we propose a novel algorithm named Selective Dynamic query (SDQ). Based on mathematical programming, SDQ calculates the optimal combination of an integer TTL value and a set of neighbors to control the scope of the next query. Our results demonstrate that SDQ provides finer grained control than other algorithms: its response latency is close to the well-known minimum one via Expanding Ring;in the mean time, its traffic cost is also close to the minimum. To our best knowledge, this is the first work capable of achieving a best trade-off between response latency and traffic cost.

关键词： Peer-to-peer networks query algorithm selective dynamic query

来源：评论

学校读者我要写书评

暂无评论

Efficient Processing XPath Queries by Compressed XML query Tree based on Structural Index

Efficient Processing XPath Queries by Compressed XML Query T...

引用

International Conference on Mechatronics and Intelligent Materials

作者： Zhang, Haiwei Hu, Xiangyu Zhang, Ying Wen, Yanlong Yuan, Xiaojie Nankai Univ Dept Comp Sci & Technol Tianjin 300071 Peoples R China

ISBN: (纸本)9783037850695

As XPath is the core of most XML query languages, the efficiency of processing XPath expression has been a main part of the cost in XML queries. However, most existing XPath processing algorithms, which don't take index structure into account, spend lots of costs on spaces and time. This paper proposes an efficient XPath query processing mechanism based on structural index that makes full use of XML structural index to quickly retrieve XML data. Coming together with the mechanism, the Compressed)(Path query Tree based on structural index is proposed, which significantly reduces many join operations. Then query algorithms are used to deal with all the structural relationship using our mechanism. Finally, experiments will run the algorithm on real XML datasets and query workloads to report the performance of our mechanism and show the efficiency compared with other mechanisms.

关键词： XPath Structural Index Compressed XPath query Tree query algorithm

来源：评论

学校读者我要写书评

暂无评论

Quantum query algorithms for Conjunctions

Quantum Query Algorithms for Conjunctions

引用

9th International Conference on Unconventional Computation

作者： Vasilieva, Alina Mischenko-Slatenkova, Taisia Univ Latvia Fac Comp LV-1459 Riga Latvia

ISBN: (纸本)9783642135224

Every Boolean function can be presented as a logical formula in conjunctive normal form. Fast algorithm for conjunction plays significant role in overall algorithm for computing arbitrary Boolean function. First, we present a quantum query algorithm for conjunction of two bits. Our algorithm uses one quantum query and correct result is obtained with a probability p = 4/5, that improves the previous result. Then, we present the main result - generalization of our approach to design efficient quantum algorithms for computing conjunction of two Boolean functions. Finally, we demonstrate another kind of an algorithm for conjunction of two bits, that has a correct answer probability p = 9/10. This algorithm improves success probability by 10%, but stands aside and cannot be extended to compute conjunction of Boolean functions.

关键词： Quantum computing query algorithm Boolean function algorithm design

来源：评论

学校读者我要写书评

暂无评论

algorithms for Approximate Shortest Path Queries on Weighted Polyhedral Surfaces

引用

DISCRETE & COMPUTATIONAL GEOMETRY 2010年第4期44卷 762-801页

作者： Aleksandrov, Lyudmil Djidjev, Hristo N. Guo, Hua Maheshwari, Anil Nussbaum, Doron Sack, Joerg-Ruediger Carleton Univ Ottawa ON K1S 5B6 Canada Bulgarian Acad Sci Sofia Bulgaria Los Alamos Natl Lab Los Alamos NM USA

We consider the well-known geometric problem of determining shortest paths between pairs of points on a polyhedral surface P, where P consists of triangular faces with positive weights assigned to them. The cost of a path in P is defined to be the weighted sum of Euclidean lengths of the sub-paths within each face of P. We present query algorithms that compute approximate distances and/or approximate shortest paths on P. Our all-pairs query algorithms take as input an approximation parameter epsilon is an element of (0, 1) and a query time parameter q, in a certain range, and build a data structure APQ( P, epsilon;q), which is then used for answering epsilon-approximate distance queries in O(q) time. As a building block of the APQ( P, epsilon;q) data structure, we develop a single-source query data structure SSQ( a;P, epsilon) that can answer epsilon-approximate distance queries from a fixed point a to any query point on P in logarithmic time. Our algorithms answer shortest path queries in weighted surfaces, which is an important extension, both theoretically and practically, to the extensively studied Euclidean distance case. In addition, our algorithms improve upon previously known query algorithms for shortest paths on surfaces. The algorithms are based on a novel graph separator algorithm introduced and analyzed here, which extends and generalizes previously known separator algorithms.

关键词： Shortest path query algorithm Separator Weighted polyhedral surface

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：