Se connecter

Bibliographies thématiques / Traversal queries / Articles de revues

Pour voir les autres types de publications sur ce sujet consultez le lien suivant : Traversal queries.

Articles de revues sur le sujet « Traversal queries »

Auteur : Grafiati

Publié le 6 septembre 2023

Mis à jour le 31 juillet 2025

Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres

Choisissez une source :

Consultez les 50 meilleurs articles de revues pour votre recherche sur le sujet « Traversal queries ».

À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.

Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.

Parcourez les articles de revues sur diverses disciplines et organisez correctement votre bibliographie.

1

Bai, Samita, and Shakeel A. Khoja. "Hybrid Query Execution on Linked Data With Complete Results." International Journal on Semantic Web and Information Systems 17, no. 1 (2021): 25–49. http://dx.doi.org/10.4018/ijswis.2021010102.

Texte intégral

Résumé :

The link traversal strategies to query Linked Data over WWW can retrieve up-to-date results using a recursive URI lookup process in real-time. The downside of this approach comes with the query patterns having subject unbound (i.e. ?S rdf:type:Class). Such queries fail to start up the traversal process as the RDF pages are subject-centric in nature. Thus, zero-knowledge link traversal leads to the empty query results for these queries. In this paper, the authors analyze a large corpus of real-world SPARQL query logs and identify the Most Frequent Predicates (MFPs) occurring in these queries. T

Styles APA, Harvard, Vancouver, ISO, etc.

2

Tang, Xian, Junfeng Zhou, Yunyu Shi, Xiang Liu, and Keng Lin. "Efficient Processing of k-Hop Reachability Queries on Directed Graphs." Applied Sciences 13, no. 6 (2023): 3470. http://dx.doi.org/10.3390/app13063470.

Texte intégral

Résumé :

Given a directed graph, a k-hop reachability query, u→?kv, is used to check for the existence of a directed path from u to v that has a length of at most k. Addressing k-hop reachability queries is a fundamental task in graph theory and has been extensively investigated. However, existing algorithms can be inefficient when answering queries because they require costly graph traversal operations. To improve query performance, we propose an approach based on a vertex cover. We construct an index that covers all reachability information using a small set of vertices from the input graph. This all

Styles APA, Harvard, Vancouver, ISO, etc.

3

Lee, Geonho, Jeongho Park, and Min-Soo Kim. "Chimera: A System Design of Dual Storage and Traversal-Join Unified Query Processing for SQL/PGQ." Proceedings of the VLDB Endowment 18, no. 2 (2024): 279–92. https://doi.org/10.14778/3705829.3705845.

Texte intégral

Résumé :

As graphs are being used increasingly in various industries, a new standard of SQL (called SQL:2023) has incorporated SQL with Property Graph Queries (SQL/PGQ) as a core feature. While some approaches process graph queries within RDBMSs using graph view definition or materialized graph view, their performance is not good enough for interactive SQL/PGQ queries in terms of response time, throughput, and graph size. To address this problem, we propose a novel system design named Chimera , which features a dual-store architecture and a unified query planning called Traversal-Join(TJ). This design

Styles APA, Harvard, Vancouver, ISO, etc.

4

Ilyas, Qazi Mudassar, Muneer Ahmad, Sonia Rauf, and Danish Irfan. "RDF Query Path Optimization Using Hybrid Genetic Algorithms." International Journal of Cloud Applications and Computing 12, no. 1 (2022): 1–16. http://dx.doi.org/10.4018/ijcac.2022010101.

Texte intégral

Résumé :

Resource Description Framework (RDF) inherently supports data mergers from various resources into a single federated graph that can become very large even for an application of modest size. This results in severe performance degradation in the execution of RDF queries. As every RDF query essentially traverses a graph to find the output of the Query, an efficient path traversal reduces the execution time of RDF queries. Hence, query path optimization is required to reduce the execution time as well as the cost of a query. Query path optimization is an NP-hard problem that cannot be solved in po

Styles APA, Harvard, Vancouver, ISO, etc.

5

Harth, Andreas, and Sebastian Speiser. "On Completeness Classes for Query Evaluation on Linked Data." Proceedings of the AAAI Conference on Artificial Intelligence 26, no. 1 (2021): 613–19. http://dx.doi.org/10.1609/aaai.v26i1.8209.

Texte intégral

Résumé :

The advent of the Web of Data kindled interest in link-traversal (or lookup-based) query processing methods, with which queries are answered via dereferencing a potentially large number of small, interlinked sources. While several algorithms for query evaluation have been proposed, there exists no notion of completeness for results of so-evaluated queries. In this paper, we motivate the need for clearly-defined completeness classes and present several notions of completeness for queries over Linked Data, based on the idea of authoritativeness of sources, and show the relation between the diffe

Styles APA, Harvard, Vancouver, ISO, etc.

6

Yao, Siyuan, Yuchen Li, Shixuan Sun, Jiaxin Jiang, and Bingsheng He. "uBlade: Efficient Batch Processing for Uncertainty Graph Queries." Proceedings of the ACM on Management of Data 2, no. 3 (2024): 1–24. http://dx.doi.org/10.1145/3654982.

Texte intégral

Résumé :

The study of uncertain graphs is crucial in diverse fields, including but not limited to protein interaction analysis, viral marketing, and network reliability. Processing queries on uncertain graphs presents formidable challenges due to the vast probabilistic space they encapsulate. While existing systems employ batch processing to address these challenges, their performance is often compromised by the suboptimal selection of parallel graph traversal methods, the excessive costs in random number generation, and additional workloads intrinsic to batch processing. In this paper, we introduce uB

Styles APA, Harvard, Vancouver, ISO, etc.

7

Chen, Yangjun. "Graph traversal and top-down evaluation of logic queries." Journal of Computer Science and Technology 13, no. 4 (1998): 300–316. http://dx.doi.org/10.1007/bf02946620.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

8

Su, Li, Xiaoming Qin, Zichao Zhang, et al. "Banyan." Proceedings of the VLDB Endowment 15, no. 10 (2022): 2045–57. http://dx.doi.org/10.14778/3547305.3547311.

Texte intégral

Résumé :

Graph query services (GQS) are widely used today to interactively answer graph traversal queries on large-scale graph data. Existing graph query engines focus largely on optimizing the latency of a single query. This ignores significant challenges posed by GQS, including fine-grained control and scheduling during query execution, as well as performance isolation and load balancing in various levels from across user to intra-query. To tackle these control and scheduling challenges, we propose a novel scoped dataflow for modeling graph traversal queries, which explicitly exposes concurrent execu

Styles APA, Harvard, Vancouver, ISO, etc.

9

Nawaz, Waqas, Kifayat Ullah Khan, and Young-Koo Lee. "Shortest path analysis for efficient traversal queries in large networks." Contemporary Engineering Sciences 7 (2014): 811–16. http://dx.doi.org/10.12988/ces.2014.4696.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

10

Sharma, Abhishek, and Kenneth Forbus. "Graph Traversal Methods for Reasoning in Large Knowledge-Based Systems." Proceedings of the AAAI Conference on Artificial Intelligence 27, no. 1 (2013): 1255–61. http://dx.doi.org/10.1609/aaai.v27i1.8473.

Texte intégral

Résumé :

Commonsense reasoning at scale is a core problem for cognitive systems. In this paper, we discuss two ways in which heuristic graph traversal methods can be used to generate plausible inference chains. First, we discuss how Cyc’s predicate-type hierarchy can be used to get reasonable answers to queries. Second, we explain how connection graph-based techniques can be used to identify script-like structures. Finally, we demonstrate through experiments that these methods lead to significant improvement in accuracy for both Q/A and script construction.

Styles APA, Harvard, Vancouver, ISO, etc.

11

Zhang, Junhua, Wentao Li, Long Yuan, Lu Qin, Ying Zhang, and Lijun Chang. "Shortest-path queries on complex networks." Proceedings of the VLDB Endowment 15, no. 11 (2022): 2640–52. http://dx.doi.org/10.14778/3551793.3551820.

Texte intégral

Résumé :

The shortest-path query, which returns the shortest path between two vertices, is a basic operation on complex networks and has numerous applications. To handle shortest-path queries, one option is to use traversal-based methods (e.g., breadth-first search); another option is to use extension-based methods, i.e., extending existing methods that use indexes to handle shortest-distance queries to support shortest-path queries. These two types of methods make different trade-offs in query time and space cost, but comprehensive studies of their performance on real-world graphs are lacking. Moreove

Styles APA, Harvard, Vancouver, ISO, etc.

12

Sayantan Saha. "Quantum Databases: Leveraging Quantum Computing for Advanced Queries." International Journal of Scientific Research in Computer Science, Engineering and Information Technology 11, no. 2 (2025): 547–55. https://doi.org/10.32628/cseit25112389.

Texte intégral

Résumé :

This article explores the transformative potential of quantum computing in database systems, focusing on advanced query operations that traditionally challenge conventional architectures. It examines how quantum mechanical phenomena like superposition and entanglement enable unprecedented parallel processing capabilities in database operations. The article investigates key areas including pattern matching, similarity searches, and graph traversal algorithms, where quantum advantages show particular promise. It compares quantum and classical systems, addressing scalability considerations and ac

Styles APA, Harvard, Vancouver, ISO, etc.

13

Qin, Jiwei, Liangli Ma, and Qing Liu. "Pruning Optimization over Threshold-Based Historical Continuous Query." Algorithms 12, no. 5 (2019): 107. http://dx.doi.org/10.3390/a12050107.

Texte intégral

Résumé :

With the increase in mobile location service applications, spatiotemporal queries over the trajectory data of moving objects have become a research hotspot, and continuous query is one of the key types of various spatiotemporal queries. In this paper, we study the sub-domain of the continuous query of moving objects, namely the pruning optimization over historical continuous query based on threshold. Firstly, for the problem that the processing cost of the Mindist-based pruning strategy is too large, a pruning strategy based on extended Minimum Bounding Rectangle overlap is proposed to optimiz

Styles APA, Harvard, Vancouver, ISO, etc.

14

Fafalios, Pavlos, and Yannis Tzitzikas. "Answering SPARQL queries on the web of data through zero-knowledge link traversal." ACM SIGAPP Applied Computing Review 19, no. 3 (2019): 18–32. http://dx.doi.org/10.1145/3372001.3372003.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

15

Tapasya Gaikwad, Ashwini Mohite, and Madhavi Tarawade. "Combinatorial Approaches to Database Query Optimization: Enhancing Efficiency and Performance." International Research Journal on Advanced Engineering and Management (IRJAEM) 3, no. 04 (2025): 1449–52. https://doi.org/10.47392/irjaem.2025.0235.

Texte intégral

Résumé :

Database query optimization plays a crucial role in the efficiency of database management systems (DBMS). As data complexity increases, optimizing query performance becomes even more critical. This paper investigates the application of combinatorial mathematics in query optimization, particularly focusing on the algorithms and techniques that aid in determining optimal query execution plans. The role of combinatorial algorithms in solving problems related to join ordering, query enumeration, and graph traversal is examined. By leveraging combinatory, database systems can process queries more e

Styles APA, Harvard, Vancouver, ISO, etc.

16

Davoudian, Ali, Liu Chen, Hongwei Tu, and Mengchi Liu. "A Workload-Adaptive Streaming Partitioner for Distributed Graph Stores." Data Science and Engineering 6, no. 2 (2021): 163–79. http://dx.doi.org/10.1007/s41019-021-00156-2.

Texte intégral

Résumé :

AbstractStreaming graph partitioning methods have recently gained attention due to their ability to scale to very large graphs with limited resources. However, many such methods do not consider workload and graph characteristics. This may degrade the performance of queries by increasing inter-node communication and computational load imbalance. Moreover, existing workload-aware methods cannot consistently provide good performance as they do not consider dynamic workloads that keep emerging in graph applications. We address these issues by proposing a novel workload-adaptive streaming partition

Styles APA, Harvard, Vancouver, ISO, etc.

17

Motte, A., C. Bovet, V. Chiaruttini, O. Jamond, and B. Prabel. "Massively parallel tandem traversal of bounding volume hierarchies for geometric queries on distributed meshes." Computers & Structures 316 (September 2025): 107843. https://doi.org/10.1016/j.compstruc.2025.107843.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

18

TIAN, JIAN-WEI, WEN-HUI QI, and XIAO-XIAO LIU. "RETRIEVING DEEP WEB DATA THROUGH MULTI-ATTRIBUTES INTERFACES WITH STRUCTURED QUERIES." International Journal of Software Engineering and Knowledge Engineering 21, no. 04 (2011): 523–42. http://dx.doi.org/10.1142/s0218194011005396.

Texte intégral

Résumé :

A great deal of data on the Web lies in the hidden databases, or the deep Web. Most of the deep Web data is not directly available and can only be accessed through the query interfaces. Current research on deep Web search has focused on crawling the deep Web data via Web interfaces with keywords queries. However, these keywords-based methods have inherent limitations because of the multi-attributes and top-k features of the deep Web. In this paper we propose a novel approach for siphoning structured data with structured queries. Firstly, in order to retrieve all the data non-repeatedly in hidd

Styles APA, Harvard, Vancouver, ISO, etc.

19

Liu, Tiantian, Huan Li, Hua Lu, Muhammad Aamir Cheema, and Lidan Shou. "Towards crowd-aware indoor path planning." Proceedings of the VLDB Endowment 14, no. 8 (2021): 1365–77. http://dx.doi.org/10.14778/3457390.3457401.

Texte intégral

Résumé :

Indoor venues accommodate many people who collectively form crowds. Such crowds in turn influence people's routing choices, e.g., people may prefer to avoid crowded rooms when walking from A to B. This paper studies two types of crowd-aware indoor path planning queries. The Indoor Crowd-Aware Fastest Path Query (FPQ) finds a path with the shortest travel time in the presence of crowds, whereas the Indoor Least Crowded Path Query (LCPQ) finds a path encountering the least objects en route. To process the queries, we design a unified framework with three major components. First, an indoor crowd

Styles APA, Harvard, Vancouver, ISO, etc.

20

Abeywickrama, Tenindra, Muhammad Aamir Cheema, and Sabine Storandt. "Hierarchical Graph Traversal for Aggregate k Nearest Neighbors Search in Road Networks." Proceedings of the International Conference on Automated Planning and Scheduling 30 (June 1, 2020): 2–10. http://dx.doi.org/10.1609/icaps.v30i1.6639.

Texte intégral

Résumé :

Location-based services rely heavily on efficient methods that search for relevant points-of-interest (POIs) close to a given location. A k nearest neighbors (kNN) query is one such example that finds k closest POIs from an agent's location. While most existing techniques focus on finding nearby POIs for a single agent, many applications require POIs that are close to multiple agents. In this paper, we study a natural extension of the kNN query for multiple agents, namely, the Aggregate k Nearest Neighbors (AkNN) query. An AkNN query retrieves k POIs with the smallest aggregate distances where

Styles APA, Harvard, Vancouver, ISO, etc.

21

Chen, Yan, Shuai Sun, and Xiaochun Hu. "DRKG: Faithful and Interpretable Multi-Hop Knowledge Graph Question Answering via LLM-Guided Reasoning Plans." Applied Sciences 15, no. 12 (2025): 6722. https://doi.org/10.3390/app15126722.

Texte intégral

Résumé :

Multi-Hop Knowledge Graph Question Answering (multi-hop KGQA) aims to obtain answers by analyzing the semantics of natural language questions and performing multi-step reasoning across multiple entities and relations in knowledge graphs. Traditional embedding-based methods map natural language questions and knowledge graphs into vector spaces for answer matching through vector operations. While these approaches have improved model performance, they face two critical challenges: the lack of clear interpretability caused by implicit reasoning mechanisms, and the semantic gap between natural lang

Styles APA, Harvard, Vancouver, ISO, etc.

22

Huang, Y., and E. Stefanakis. "MULTI-RESOLUTION REPRESENTATION USING GRAPH DATABASE." ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences V-4-2022 (May 18, 2022): 173–80. http://dx.doi.org/10.5194/isprs-annals-v-4-2022-173-2022.

Texte intégral

Résumé :

Abstract. Multi-resolution representation has always been an important and popular data source for many research and applications, such as navigation, land cover, map generation, media event forecasting, etc. With one spatial object represented by distinct geometries at different resolutions, multi-resolution representation is high in complexity. Most of the current approaches for storing and retrieving multi-resolution representation are either complicated in structure, or time consuming in traversal and query. In addition, supports on direct navigation between different representations are s

Styles APA, Harvard, Vancouver, ISO, etc.

23

BLANDFORD, DANIEL K., GUY E. BLELLOCH, DAVID E. CARDOZE, and CLEMENS KADOW. "COMPACT REPRESENTATIONS OF SIMPLICIAL MESHES IN TWO AND THREE DIMENSIONS." International Journal of Computational Geometry & Applications 15, no. 01 (2005): 3–24. http://dx.doi.org/10.1142/s0218195905001580.

Texte intégral

Résumé :

We describe data structures for representing simplicial meshes compactly while supporting online queries and updates efficiently. Our data structure requires about a factor of five less memory than the most efficient standard data structures for triangular or tetrahedral meshes, while efficiently supporting traversal among simplices, storing data on simplices, and insertion and deletion of simplices. Our implementation of the data structures uses about 5 bytes/triangle in two dimensions (2D) and 7.5 bytes/tetrahedron in three dimensions (3D). We use the data structures to implement 2D and 3D i

Styles APA, Harvard, Vancouver, ISO, etc.

24

Evangelista S., Jacqueline, Adityas Widjajarto, and Avon Budiyono. "ANALISA PERANKINGAN KONTROL KEAMANAN ASPEK SISTEM PADA CMS WORDPRESS." Jurnal Informatika dan Rekayasa Elektronik 8, no. 1 (2025): 1–12. https://doi.org/10.36595/jire.v8i1.1279.

Texte intégral

Résumé :

Penggunaan Content Management System (CMS) seperti WordPress sangat populer, namun juga rentan terhadap serangan siber. Laporan GoDaddy pada 2018 mencatat 18.302 insiden peretasan, di mana 90% menargetkan WordPress. Penelitian ini bertujuan untuk mengidentifikasi dan mengevaluasi kerentanan WordPress, serta menyusun desain kontrol keamanan berdasarkan standar OWASP Top Ten. Penelitian dilakukan melalui eksperimen dan simulasi yang menekankan eksploitasi kerentanan WordPress. Lima kerentanan utama ditemukan, yaitu Broken Access Control pada PHP 8.1.0-dev dan Apache 2.4.49 dengan tingkat "High",

Styles APA, Harvard, Vancouver, ISO, etc.

25

Jiang, Wenqi, Oleh-Yevhen Khavrona, Martin Parvanov, and Gustavo Alonso. "SwiftSpatial: Spatial Joins on Modern Hardware." Proceedings of the ACM on Management of Data 3, no. 3 (2025): 1–27. https://doi.org/10.1145/3725361.

Texte intégral

Résumé :

Spatial joins are among the most time-consuming spatial queries, remaining costly even in parallel and distributed systems. In this paper, we explore hardware acceleration for spatial joins by proposing SwiftSpatial, an FPGA-based accelerator that can be deployed in data centers and at the edge. SwiftSpatial contains multiple high-performance join units with innovative hybrid parallelism, several efficient memory management units, and an extensible on-chip join scheduler that supports the popular R-tree synchronous traversal and partition-based spatial-merge (PBSM) algorithms. Benchmarked agai

Styles APA, Harvard, Vancouver, ISO, etc.

26

Huang, Qingrong, Xiaocong Lai, Qianxiang Su, and Ying Pan. "RDF Subgraph Query Based on Common Subgraph in Distributed Environment." Wireless Communications and Mobile Computing 2023 (January 13, 2023): 1–15. http://dx.doi.org/10.1155/2023/7148071.

Texte intégral

Résumé :

With the gradual development of the network, RDF graphs have become more and more complex as the scale of data increases; how to perform more effective query for massive RDF graphs is a hot topic of continuous research. The traditional methods of graph query and graph traversal produce great redundancy of intermediate results, and processing subgraph collection queries in stand-alone mode cannot perform efficient matching when the amount of data is extremely large. Moreover, when processing subgraph collection queries, it is necessary to iterate the query graph multiple times in the query of t

Styles APA, Harvard, Vancouver, ISO, etc.

27

Chamani, Javad Ghareh, Ioannis Demertzis, Dimitrios Papadopoulos, Charalampos Papamanthou, and Rasool Jalili. "GraphOS: Towards Oblivious Graph Processing." Proceedings of the VLDB Endowment 16, no. 13 (2023): 4324–38. http://dx.doi.org/10.14778/3625054.3625067.

Texte intégral

Résumé :

We propose GraphOS, a system that allows a client that owns a graph database to outsource it to an untrusted server for storage and querying. It relies on doubly-oblivious primitives and trusted hardware to achieve a very strong privacy and efficiency notion which we call oblivious graph processing : the server learns nothing besides the number of graph vertexes and edges, and for each query its type and response size. At a technical level, GraphOS stores the graph on a doubly-oblivious data structure , so that all vertex/edge accesses are indistinguishable. For this purpose, we propose Omix++

Styles APA, Harvard, Vancouver, ISO, etc.

28

Zhang, Fengquan, Jiaojiao Guo, Jianfei Wan, and Junli Qin. "Efficient Culling Criteria for Continues Collision Detection Using a Fast Statistical Analysis Method." Open Mechanical Engineering Journal 9, no. 1 (2015): 569–73. http://dx.doi.org/10.2174/1874155x01509010569.

Texte intégral

Résumé :

Continuous Collision Detection (CCD) between deforming triangle mesh elements in 3D is significant in many computer and graphics applications, such as virtual surgery, simulation and animation. Although CCD is more accurate than discrete methods, its application is limited mainly due to its time-consuming nature. To accelerate computation, we present an efficient CCD method to perform both inter-object and intra-object collision queries of triangle mesh models. Given a model set of different poses as training data, our method uses Statistic Analysis (SA) to make regression on a deformation sub

Styles APA, Harvard, Vancouver, ISO, etc.

29

Kim, Juyoung, Seoyoung Hong, Seungchan Jeong, Seula Park, and Kiyun Yu. "SGIR-Tree: Integrating R-Tree Spatial Indexing as Subgraphs in Graph Database Management Systems." ISPRS International Journal of Geo-Information 13, no. 10 (2024): 346. http://dx.doi.org/10.3390/ijgi13100346.

Texte intégral

Résumé :

Efficient spatial query processing in Graph Database Management Systems (GDBMSs) has become increasingly important owing to the prevalence of spatial graph data. However, current GDBMSs lack effective spatial indexing, causing performance issues with complex spatial graph queries. This study proposes a spatial index called Subgraph Integrated R-Tree (SGIR-Tree) for efficient spatial query processing in GDBMSs. The SGIR-Tree integrates the hierarchical R-Tree structure with the graph structure of GDBMSs by converting R-Tree elements into graph components like nodes and edges. The Minimum Boundi

Styles APA, Harvard, Vancouver, ISO, etc.

30

Jin, Wenxuan, Mingjun Zheng, and Pingzeng Liu. "Design of Multi-Chain Traceability Model for Pepper Products Based on Traceability Code." Applied Sciences 14, no. 9 (2024): 3809. http://dx.doi.org/10.3390/app14093809.

Texte intégral

Résumé :

In the specific application scenario of pepper product supply chain traceability, with the advancement of pepper product production, the expansion of links, and the increase of nodes, the quantity of data will become more and more enormous. The single-chain model is less efficient for querying if the data are all stored into the same blockchain. In order to improve the efficiency of blockchain data querying, this paper proposes a traceability model with one main chain and multiple side chain structures, which separate the uplinked data from each link and use multi-chain transactions to improve

Styles APA, Harvard, Vancouver, ISO, etc.

31

Ares, Gonzalo, César Castañón Fernández, and Isidro Diego Álvarez. "Ultimate Pit-Limit Optimization Algorithm Enhancement Using Structured Query Language." Minerals 13, no. 7 (2023): 966. http://dx.doi.org/10.3390/min13070966.

Texte intégral

Résumé :

Three-dimensional block models are the most widely used tool for the study and evaluation of ore deposits, the calculation and design of economical pits, mine production planning, and physical and numerical simulations of ore deposits. The way these algorithms and computational techniques are programmed is usually through complex C++, C# or Python libraries. Database programming languages such as SQL (Structured Query Language) have traditionally been restricted to drillhole sample data operation. However, major advances in the management and processing of large databases have opened up the po

Styles APA, Harvard, Vancouver, ISO, etc.

32

Snehal Eknath Phule. "Graph Theory Applications in Database Management." International Journal of Scientific Research in Modern Science and Technology 3, no. 3 (2024): 13–17. http://dx.doi.org/10.59828/ijsrmst.v3i3.190.

Texte intégral

Résumé :

Graph theory, which is a branch of discrete mathematics, has emerged as a powerful tool in various domains, including database management. This abstract investigates the ways in which ideas and methods from graph theory which can be applied to database systems, offering a thorough synopsis of their benefits. Complex interactions within data can be well-modeled by using the basic concepts of graph theory, such as nodes, edges, and relationships. Because of its capacity to represent and query complex relationships, graph databases have become more and more popular in the field of database admini

Styles APA, Harvard, Vancouver, ISO, etc.

33

Шевский, В. С. "Development of a data indexing algorithm based on the CW-tree data structure using parallel computing." МОДЕЛИРОВАНИЕ, ОПТИМИЗАЦИЯ И ИНФОРМАЦИОННЫЕ ТЕХНОЛОГИИ 9, no. 1(32) (2021): 13–14. http://dx.doi.org/10.26102/2310-6018/2021.32.1.013.

Texte intégral

Résumé :

Цель данного научного исследования состояла в разработке алгоритма индексирования данных с использованием технологий параллельных вычислений, применение которого приводило бы к уменьшению времени на обработку запросов к базе данных. В ходе исследования был разработан алгоритм индексирования данных на основе специальной структуры хранения данных на базе дерева, получившей название CW-tree (Constantly-Wide tree). Проход по CW-tree в соответствии с предлагаемым алгоритмом индексирования осуществляется в асинхронном режиме, что достигается благодаря использованию дополнительных стартовых вершин. К

Styles APA, Harvard, Vancouver, ISO, etc.

34

Rani, Katari Pushpa, L. Lakshmi, Ch Sabitha, B. Dhana Lakshmi, and S. Sreeja. "Top-K search scheme on encrypted data in cloud." International Journal of Advances in Applied Sciences 9, no. 1 (2020): 67. http://dx.doi.org/10.11591/ijaas.v9.i1.pp67-69.

Texte intégral

Résumé :

<span>A Secure and Effective Multi-keyword Ranked Search Scheme on Encrypted Cloud Data. Cloud computing is providing people a very good knowledge on all the popular and relevant domains which they need in their daily life. For this, all the people who act as Data Owners must possess some knowledge on Cloud should be provided with more information so that it will help them to make the cloud maintenance and administration easy. And most important concern these days is privacy. Some sensitive data exposed in the cloud these days have security issues. So, sensitive information ought to be e

Styles APA, Harvard, Vancouver, ISO, etc.

35

K., Pushpa Rani, Lakshmi L., Sabitha Ch., Dhana Lakshmi B., and Sreeja S. "Top-K search scheme on encrypted data in cloud." International Journal of Advances in Applied Sciences (IJAAS) 9, no. 1 (2020): 67–69. https://doi.org/10.11591/ijaas.v9.i1.pp67-69.

Texte intégral

Résumé :

A Secure and Effective Multi-keyword Ranked Search Scheme on Encrypted Cloud Data. Cloud computing is providing people a very good knowledge on all the popular and relevant domains which they need in their daily life. For this, all the people who act as Data Owners must possess some knowledge on Cloud should be provided with more information so that it will help them to make the cloud maintenance and administration easy. And most important concern these days is privacy. Some sensitive data exposed in the cloud these days have security issues. So, sensitive information ought to be encrypted ear

Styles APA, Harvard, Vancouver, ISO, etc.

36

Quer, Stefano, and Andrea Calabrese. "Graph Reachability on Parallel Many-Core Architectures." Computation 8, no. 4 (2020): 103. http://dx.doi.org/10.3390/computation8040103.

Texte intégral

Résumé :

Many modern applications are modeled using graphs of some kind. Given a graph, reachability, that is, discovering whether there is a path between two given nodes, is a fundamental problem as well as one of the most important steps of many other algorithms. The rapid accumulation of very large graphs (up to tens of millions of vertices and edges) from a diversity of disciplines demand efficient and scalable solutions to the reachability problem. General-purpose computing has been successfully used on Graphics Processing Units (GPUs) to parallelize algorithms that present a high degree of regula

Styles APA, Harvard, Vancouver, ISO, etc.

37

Hume, Samuel, Surendra Sarnikar, and Cherie Noteboom. "Enhancing Traceability in Clinical Research Data through a Metadata Framework." Methods of Information in Medicine 59, no. 02/03 (2020): 075–85. http://dx.doi.org/10.1055/s-0040-1714393.

Texte intégral

Résumé :

Abstract Background The clinical research data lifecycle, from data collection to analysis results, functions in silos that restrict traceability. Traceability is a requirement for regulated clinical research studies and an important attribute of nonregulated studies. Current clinical research software tools provide limited metadata traceability capabilities and are unable to query variables across all phases of the data lifecycle. Objectives To develop a metadata traceability framework that can help query and visualize traceability metadata, identify traceability gaps, and validate metadata t

Styles APA, Harvard, Vancouver, ISO, etc.

38

Liu, Jing, and Yong Zhong. "An Algorithm for Finding Optimal k-Core in Attribute Networks." Applied Sciences 14, no. 3 (2024): 1256. http://dx.doi.org/10.3390/app14031256.

Texte intégral

Résumé :

As a structural indicator of dense subgraphs, k-core has been widely used in community search due to its concise and efficient calculation. Many community search algorithms have been expanded on the basis of k-core. However, relevant algorithms often set k values based on empirical analysis of datasets or require users to input manually. Once users are not familiar with the graph network structure, they may miss the optimal solution due to an improper k setting. Especially in attribute social networks, characterizing communities with only k-cores may lead to a lack of semantic interpretability

Styles APA, Harvard, Vancouver, ISO, etc.

39

Kushnir, Eyal, Guy Moshkowich, and Hayim Shaul. "Secure Range-Searching Using Copy-And-Recurse." Proceedings on Privacy Enhancing Technologies 2024, no. 3 (2024): 626–44. http://dx.doi.org/10.56553/popets-2024-0096.

Texte intégral

Résumé :

Range searching is the problem of preprocessing a set of points P, such that given a query range gamma we can efficiently compute some function f(P cap gamma). For example, in a 1 dimensional range counting query, P is a set of numbers, gamma is a segment and we need to count how many numbers of P are in gamma. In higher dimensions, P is a set of d dimensional points and the query range is some volume in R^d. In general, we want to compute more than just counting, for example, the average of P cap gamma. Range searching has applications in databases where some SELECT queries can be translated

Styles APA, Harvard, Vancouver, ISO, etc.

40

Pratt, Michael P., Srinivas R. Geedipally, Bahar Dadashova, Lingtao Wu, and Mohammadali Shirazi. "Familiar versus Unfamiliar Drivers on Curves: Naturalistic Data Study." Transportation Research Record: Journal of the Transportation Research Board 2673, no. 6 (2019): 225–35. http://dx.doi.org/10.1177/0361198119846481.

Texte intégral

Résumé :

Human factors studies have shown that route familiarity affects driver behavior in various ways. Specifically, when drivers become more familiar with a roadway, they pay less attention to signs, adopt higher speeds, cut curves more noticeably, and exhibit slower reaction times to stimuli in their peripheral vision. Numerous curve speed models have been developed for purposes such as predicting driver behavior, evaluating roadway design consistency, and setting curve advisory speeds. These models are typically calibrated using field data, which gives information about driver behavior in relatio

Styles APA, Harvard, Vancouver, ISO, etc.

41

ATALAY, F. BETUL, and DAVID M. MOUNT. "POINTERLESS IMPLEMENTATION OF HIERARCHICAL SIMPLICIAL MESHES AND EFFICIENT NEIGHBOR FINDING IN ARBITRARY DIMENSIONS." International Journal of Computational Geometry & Applications 17, no. 06 (2007): 595–631. http://dx.doi.org/10.1142/s0218195907002495.

Texte intégral

Résumé :

We describe a pointerless representation of hierarchical regular simplicial meshes, based on a bisection approach proposed by Maubach. We introduce a new labeling scheme, called an LPT code, which uniquely encodes the geometry of each simplex of the hierarchy, and we present rules to compute the neighbors of a given simplex efficiently through the use of these codes. In addition, we show how to traverse the associated tree and how to answer point location and interpolation queries. Our system works in arbitrary dimensions.

Styles APA, Harvard, Vancouver, ISO, etc.

42

Bonerath, Annika, Yu Dong, and Jan-Henrik Haunert. "A Data Structure for the Interactive Exploration of Public Transportation Networks." Advances in Cartography and GIScience of the ICA 4 (August 7, 2023): 1–8. http://dx.doi.org/10.5194/ica-adv-4-1-2023.

Texte intégral

Résumé :

Abstract. To understand the quality of a public transportation network, map-based visualizations are the first choice. Since the network quality depends on the transportation schedule, the visualization interface should also incorporate time. In this work, we provide such an interface where users can filter the data for time windows. When a user queries for a certain time window, we display all network segments that are traversed by at least θ means of public transportation, e.g., buses in the time window on the map.Since such transportation networks can contain a high number of network segmen

Styles APA, Harvard, Vancouver, ISO, etc.

43

Amit, Yali, and Donald Geman. "Shape Quantization and Recognition with Randomized Trees." Neural Computation 9, no. 7 (1997): 1545–88. http://dx.doi.org/10.1162/neco.1997.9.7.1545.

Texte intégral

Résumé :

We explore a new approach to shape recognition based on a virtually infinite family of binary features (queries) of the image data, designed to accommodate prior information about shape invariance and regularity. Each query corresponds to a spatial arrangement of several local topographic codes (or tags), which are in themselves too primitive and common to be informative about shape. All the discriminating power derives from relative angles and distances among the tags. The important attributes of the queries are a natural partial ordering corresponding to increasing structure and complexity;

Styles APA, Harvard, Vancouver, ISO, etc.

44

Sun, Yuhan, and Mohamed Sarwat. "Riso-Tree: An Efficient and Scalable Index for Spatial Entities in Graph Database Management Systems." ACM Transactions on Spatial Algorithms and Systems 7, no. 3 (2021): 1–39. http://dx.doi.org/10.1145/3450945.

Texte intégral

Résumé :

With the ubiquity of spatial data, vertexes or edges in graphs can possess spatial location attributes side by side with other non-spatial attributes. For instance, as of June 2018, the Wikidata knowledge graph contains 48,547,142 data items (i.e., vertexes) and 13% of them have spatial location attributes. The article proposes Riso-Tree, a generic efficient and scalable indexing framework for spatial entities in graph database management systems. Riso-Tree enables the fast execution of graph queries that involve different types of spatial predicates (GraSp queries). The proposed framework aug

Styles APA, Harvard, Vancouver, ISO, etc.

45

Hechenberger, Ryan, Peter J. Stuckey, Daniel Harabor, Pierre Le Bodic, and Muhammad Aamir Cheema. "Online Computation of Euclidean Shortest Paths in Two Dimensions." Proceedings of the International Conference on Automated Planning and Scheduling 30 (June 1, 2020): 134–42. http://dx.doi.org/10.1609/icaps.v30i1.6654.

Texte intégral

Résumé :

We consider the online version of Euclidean Shortest Path (ESP): a problem that asks for distance minimal trajectories between traversable pairs of points in the plane. The problem is made challenging because each trajectory must avoid a set of non-traversable obstacles represented as polygons. To solve ESP practitioners will often preprocess the environment and construct specialised data structures, such as visibility graphs and navigation meshes. Pathfinding queries on these data structures are fast but the preprocessed data becomes invalidated when obstacles move or change. In this work we

Styles APA, Harvard, Vancouver, ISO, etc.

46

Prateek, Raman* Ravi Kant Gautam Ravi Yadav Manish Kumar Sharma. "BUILDING HIGHLY SPECIALISED WEB CRAWLER USING B-TREE SEARCH AND HTML PARSER." International Journal OF Engineering Sciences & Management Research 3, no. 5 (2016): 98–102. https://doi.org/10.5281/zenodo.51574.

Texte intégral

Résumé :

Web crawlers are Internet bot that automatically traverse the hyper-link structure of the world wide web in order to locate and retrieve information. This paper describes a web crawling approach based on B-tree search and HTML Parser. As the goal of crawler is to selectively seek out pages that are relevant to given keywords. Rather than collecting and indexing all available web documents to be able to answer all possible queries, a crawler analyze its crawl boundary to hit upon the links that are likely to be most relevant for the crawl, and avoids irrelevant links of the document.  &nbs

Styles APA, Harvard, Vancouver, ISO, etc.

47

Cox, Steven, Stanley C. Ahalt, James Balhoff, et al. "Visualization Environment for Federated Knowledge Graphs: Development of an Interactive Biomedical Query Language and Web Application Interface." JMIR Medical Informatics 8, no. 11 (2020): e17964. http://dx.doi.org/10.2196/17964.

Texte intégral

Résumé :

Background Efforts are underway to semantically integrate large biomedical knowledge graphs using common upper-level ontologies to federate graph-oriented application programming interfaces (APIs) to the data. However, federation poses several challenges, including query routing to appropriate knowledge sources, generation and evaluation of answer subsets, semantic merger of those answer subsets, and visualization and exploration of results. Objective We aimed to develop an interactive environment for query, visualization, and deep exploration of federated knowledge graphs. Methods We develope

Styles APA, Harvard, Vancouver, ISO, etc.

48

Tong, Bing, Yan Zhou, Chen Zhang, et al. "Galaxybase: A High Performance Native Distributed Graph Database for HTAP." Proceedings of the VLDB Endowment 17, no. 12 (2024): 3893–905. http://dx.doi.org/10.14778/3685800.3685814.

Texte intégral

Résumé :

We introduce Galaxybase, a native distributed graph database that addresses the increasing demands for processing large volumes of graph data in diverse industries like finance, manufacturing, and government. Designed to handle the requirements of both transactional and analytical workloads, Galaxybase stands out with its novel data storage and transaction mechanisms. At its core, Galaxybase utilizes a Log-Structured Adjacency List coupled with an Edge Page structure, optimizing read-write operations across a spectrum of tasks such as graph traversals and single edge queries. A notable aspect

Styles APA, Harvard, Vancouver, ISO, etc.

49

Manjula, D., and T. V. Geetha. "Semantic Search Engine." Journal of Information & Knowledge Management 03, no. 01 (2004): 107–17. http://dx.doi.org/10.1142/s0219649204000729.

Texte intégral

Résumé :

Currently existing search engines index documents only by words and as a result, when a query can be interpreted in different senses, the irrelevant results are obtained in the midst of relevant results. A semantic search engine is proposed here which indexes documents both by words and senses and as a result tries to avoid the irrelevant results. The "crawler" traverses the worldwide web and the normalized documents are sent to the disambiguator module, which identifies the top few sense(s) of ambiguous words by employing a weighted disambiguation algorithm. The documents are then indexed by

Styles APA, Harvard, Vancouver, ISO, etc.

50

Sassi, Najla, and Wassim Jaziri. "Efficient AI-Driven Query Optimization in Large-Scale Databases: A Reinforcement Learning and Graph-Based Approach." Mathematics 13, no. 11 (2025): 1700. https://doi.org/10.3390/math13111700.

Texte intégral

Résumé :

As data-centric applications become increasingly complex, understanding effective query optimization in large-scale relational databases is crucial for managing this complexity. Yet, traditional cost-based and heuristic approaches simply do not scale, adapt, or remain accurate in highly dynamic multi-join queries. This research work proposes the reinforcement learning and graph-based hybrid query optimizer (GRQO), the first ever to apply reinforcement learning and graph theory for optimizing query execution plans, specifically in join order selection and cardinality estimation. By employing pr

Styles APA, Harvard, Vancouver, ISO, etc.

Nous offrons des réductions sur tous les plans premium pour les auteurs dont les œuvres sont incluses dans des sélections littéraires thématiques. Contactez-nous pour obtenir un code promo unique!