Bibliographies thématiques / Traversal queries

Sommaire

Articles de revues
Thèses
Livres
Chapitres de livres
Actes de conférences

Littérature scientifique 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 listes thématiques d’articles de revues, de livres, de thèses, de rapports de conférences et d’autres sources académiques 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.

Articles de revues sur le sujet "Traversal queries"

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

Plus de sources

Thèses sur le sujet "Traversal queries"

Sharma, Abhilash. "Optimization of Traversal Queries on Distributed Graph Stores." Thesis, 2018. https://etd.iisc.ac.in/handle/2005/5397.

Texte intégral

Résumé :

In this era of Big Data Analytics, much of the semi-structured data has inherent interconnectivity between representative entities. These are increasingly being modeled as property graphs because of the semantic advantages of the associations/edges formed between entities/vertices and their attributes that helps with their analysis. These graphs scale to billions of edges thereby requiring distributed frameworks. Giraph, GoFFish, Blogel are some of the distributed frameworks for graph analytics. These are generally used for long-running analytical queries that may take minutes or hours,

Styles APA, Harvard, Vancouver, ISO, etc.

Livres sur le sujet "Traversal queries"

Anthapu, Ravindranatha. Graph Data Processing with Cypher: A practical guide to building graph traversal queries using the Cypher syntax on Neo4j. Packt Publishing, 2022.

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Anthapu, Ravindranatha. Graph Data Processing with Cypher: A Practical Guide to Building Graph Traversal Queries Using the Cypher Syntax on Neo4j. de Gruyter GmbH, Walter, 2022.

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Chapitres de livres sur le sujet "Traversal queries"

Tesfaye, Bezaye, Nikolaus Augsten, Mateusz Pawlik, Michael H. Böhlen, and Christian S. Jensen. "An Efficient Index for Reachability Queries in Public Transport Networks." In Advances in Databases and Information Systems. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-54832-2_5.

Texte intégral

Résumé :

AbstractComputing path queries such as the shortest path in public transport networks is challenging because the path costs between nodes change over time. A reachability query from a node at a given start time on such a network retrieves all points of interest (POIs) that are reachable within a given cost budget. Reachability queries are essential building blocks in many applications, for example, group recommendations, ranking spatial queries, or geomarketing. We propose an efficient solution for reachability queries in public transport networks. Currently, there are two options to solve rea

Styles APA, Harvard, Vancouver, ISO, etc.

De Carlos, Xabier, Goiuria Sagardui, and Salvador Trujillo. "Two-Step Transformation of Model Traversal EOL Queries for Large CDO Repositories." In Fundamental Approaches to Software Engineering. Springer Berlin Heidelberg, 2016. http://dx.doi.org/10.1007/978-3-662-49665-7_9.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Firsov, Mikhail, Michael Polyntsov, Kirill Smirnov, and George Chernishev. "Finding a Second Wind: Speeding Up Graph Traversal Queries in RDBMSs Using Column-Oriented Processing." In Model and Data Engineering. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-49333-1_14.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Cuddihy, Paul, Daniel Russell, Eric Mertens, Kit Siu, Dave Archer, and Jenny Williams. "Aviation Certification Powered by the Semantic Web Stack." In The Semantic Web – ISWC 2023. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-47243-5_19.

Texte intégral

Résumé :

AbstractEvery deployed DoD system undergoes certification (or qualification, for military) to assess the software system’s fitness for use. Certification requires that human subject matter expert look over evidence and evaluate its conformance to standards such as DO-178C or the Risk Management Framework (RMF). Current practices are not keeping pace with the ever-increasing size of software systems and the amount of evidence required for their certification. This problem is further exasperated when platforms are comprised of systems of systems developed by multiple suppliers, each providing da

Styles APA, Harvard, Vancouver, ISO, etc.

Peter, Hadrian, and Charles Greenidge. "Data Extraction from Deep Web Sites." In Encyclopedia of Internet Technologies and Applications. IGI Global, 2008. http://dx.doi.org/10.4018/978-1-59140-993-9.ch021.

Texte intégral

Résumé :

Traditionally a great deal of research has been devoted to data extraction on the web (Crescenzi, et al, 2001; Embley, et al, 2005; Laender, et al, 2002; Hammer, et al, 1997; Ribeiro-Neto, et al, 1999; Huck, et al, 1998; Wang & Lochovsky, 2002, 2003) from areas where data is easily indexed and extracted by a Search Engine, the so-called Surface Web. There are, however, other sites that are greater and potentially more vital, that contain information which cannot be readily indexed by standard search engines. These sites which have been designed to require some level of direct human partici

Styles APA, Harvard, Vancouver, ISO, etc.

D'Antonio Mattia, D'Onorio De Meo Paolo, Cacciari Claudio, and Fiameni Giuseppe. "Characterization of Genomic Data Using Graph Databases." In Advances in Parallel Computing. IOS Press, 2018. https://doi.org/10.3233/978-1-61499-843-3-423.

Texte intégral

Résumé :

The amount of genomic data produced by DNA-sequencing is growing at an unprecedented rate due to the ever greater throughput provided by the new generation of genome sequencing (NGS) platforms. To understand and interpret biological data a huge number of metadata and annotations are required. Genomic metadata include very heterogeneous biological and clinical attributes gathered at different levels of details such as diseases, genes, proteins, interactions, pathways but also phenotypic characterization of patients and clinical evidence or diagnosis. All these information are required to draw a

Styles APA, Harvard, Vancouver, ISO, etc.

Actes de conférences sur le sujet "Traversal queries"

Aljuaid, Nouf, Alexei Lisitsa, and Sven Schewe. "Secure Multi-Party Traversal Queries over Federated Graph Databases." In 21st International Conference on Security and Cryptography. SCITEPRESS - Science and Technology Publications, 2024. http://dx.doi.org/10.5220/0012768000003767.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Martinez-Bazan, Norbert, and David Dominguez-Sal. "Using semijoin programs to solve traversal queries in graph databases." In SIGMOD/PODS'14: International Conference on Management of Data. ACM, 2014. http://dx.doi.org/10.1145/2621934.2621943.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Nawaz, Waqas, Kifayat-Ullah Khan, and Young-Koo Lee. "CORE Analysis for Efficient Shortest Path Traversal Queries in Social Graphs." In 2014 IEEE International Conference on Big Data and Cloud Computing (BdCloud). IEEE, 2014. http://dx.doi.org/10.1109/bdcloud.2014.11.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Fafalios, Pavlos, and Yannis Tzitzikas. "How many and what types of SPARQL queries can be answered through zero-knowledge link traversal?" In SAC '19: The 34th ACM/SIGAPP Symposium on Applied Computing. ACM, 2019. http://dx.doi.org/10.1145/3297280.3297505.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Lu, Qifeng, and Kathleen Hancock. "C*: A Bivariate Best First Search to Process Category Sequence Traversal Queries in a Transportation Network." In 2010 Second International Conference on Advanced Geographic Information Systems, Applications, and Services (GEOPROCESSING). IEEE, 2010. http://dx.doi.org/10.1109/geoprocessing.2010.27.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Abeywickrama, Tenindra, Muhammad Aamir Cheema, and Sabine Storandt. "Hierarchical Graph Traversal for Aggregate k Nearest Neighbors Search in Road Networks (Extended Abstract)." In Thirtieth International Joint Conference on Artificial Intelligence {IJCAI-21}. International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/ijcai.2021/640.

Texte intégral

Résumé :

A k nearest neighbors (kNN) query finds k closest points-of-interest (POIs) from an agent's location. 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 the aggregate distance of a POI is obtained by aggregating its distances from the multiple agents (e.g., sum of its distances from each agent). We propose a novel data structure COLT (Compacted Object-Landmark Tree) which enables efficient hierarchical graph traversal and utilize it t

Styles APA, Harvard, Vancouver, ISO, etc.

Allen, Marshall D., Raymundo Arróyave, and Richard Malak. "A Graph Database Schema for Metal Additive Informatics." In ASME 2024 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2024. http://dx.doi.org/10.1115/detc2024-141981.

Texte intégral

Résumé :

Abstract Metal additive manufacturing (AM) enables the creation of metal structures with complex materials and geometry for advanced performance capabilities. Metal AM continues to grow in popularity for use cases from alloy design to advanced manufacturing. In this work, we identify the requirements for a novel metal AM informatics schema based on the benefits and shortcomings of existing methods. After investigating different types of databases as the basis of our schema, including relational database management systems (RDBMS) and graph databases (GDBs), we identify the labeled property gra

Styles APA, Harvard, Vancouver, ISO, etc.

Tetzel, Frank, Romans Kasperovics, and Wolfgang Lehner. "Graph Traversals for Regular Path Queries." In the 2nd Joint International Workshop. ACM Press, 2019. http://dx.doi.org/10.1145/3327964.3328494.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Henríquez Ortiz, Valentina Paz. "El documental chileno de post-dictadura y la dimensión performática del lenguaje audiovisual en el conflicto político." In IV Congreso Internacional de Investigación en Artes Visuales. ANIAV 2019. Imagen [N] Visible. Universitat Politècnica de València, 2019. http://dx.doi.org/10.4995/aniav.2019.9014.

Texte intégral

Résumé :

Uno de los mayores acontecimientos sociales y políticos en la historia reciente de Chile, es sin duda, la dictadura militar extendida entre los años 1973 y 1989. Frente a este acontecimiento, múltiples producciones culturales pueden servir como herramientas críticas para acercarnos al pasado, y una de ellas es el documental. Específicamente el documental de post-dictadura, que como sugiere Antonio Traverso, no refiere a una determinada historiografía, sino a aquellos filmes que guardan una relación crítica con el pasado. Bajo este parámetro, podemos encontrar recientes producciones como El Pac

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!