Увійти

Готові списки джерел за темами / Traversal queries

Добірка наукової літератури з теми "Traversal queries"

Автор: Grafiati

Опубліковано: 6 вересня 2023

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Зміст

Статті в журналах
Книги
Частини книг
Тези доповідей конференцій

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Traversal queries".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Статті в журналах з теми "Traversal queries"

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 (January 2021): 25–49. http://dx.doi.org/10.4018/ijswis.2021010102.

Повний текст джерела

Анотація:

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. The knowledge of these MFPs helps in finding and indexing a limited number of triples from the original data set. Additionally, the authors propose a Hybrid Query Execution (HQE) approach to execute the queries over this index for initial data source selection followed by link traversal process to fetch complete results. The evaluation of HQE on the latest real data benchmarks reveals that it retrieves at least five times more results than the existing approaches.

Стилі APA, Harvard, Vancouver, ISO та ін.

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 (March 8, 2023): 3470. http://dx.doi.org/10.3390/app13063470.

Повний текст джерела

Анотація:

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 allows us to answer k-hop reachability queries without performing graph traversal. We propose a linear-time algorithm to quickly compute a vertex cover, S, which we use to develop a novel labeling scheme and two algorithms for efficient query answering. The experimental results demonstrate that our approach significantly outperforms the existing approaches in terms of query response time.

Стилі APA, Harvard, Vancouver, ISO та ін.

3

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

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

4

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 (September 20, 2021): 613–19. http://dx.doi.org/10.1609/aaai.v26i1.8209.

Повний текст джерела

Анотація:

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 different completeness classes.

Стилі APA, Harvard, Vancouver, ISO та ін.

5

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 (January 2022): 1–16. http://dx.doi.org/10.4018/ijcac.2022010101.

Повний текст джерела

Анотація:

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 polynomial time. Genetic algorithms have proven to be very useful in optimization problems. We propose a hybrid genetic algorithm for query path optimization. The proposed algorithm selects an initial population using iterative improvement thus reducing the initial solution space for the genetic algorithm. The proposed algorithm makes significant improvements in the overall performance. We show that the overall number of joins for complex queries is reduced considerably, resulting in reduced cost.

Стилі APA, Harvard, Vancouver, ISO та ін.

6

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.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

7

Su, Li, Xiaoming Qin, Zichao Zhang, Rui Yang, Le Xu, Indranil Gupta, Wenyuan Yu, Kai Zeng, and Jingren Zhou. "Banyan." Proceedings of the VLDB Endowment 15, no. 10 (June 2022): 2045–57. http://dx.doi.org/10.14778/3547305.3547311.

Повний текст джерела

Анотація:

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 execution and control of any subquery to the finest granularity. We implemented Banyan, an engine based on the scoped dataflow model for GQS. Banyan focuses on scaling up the performance on a single machine, and provides the ability to easily scale out. Extensive experiments on multiple benchmarks show that Banyan improves performance by up to three orders of magnitude over state-of-the-art graph query engines, while providing performance isolation and load balancing.

Стилі APA, Harvard, Vancouver, ISO та ін.

8

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 (June 29, 2013): 1255–61. http://dx.doi.org/10.1609/aaai.v27i1.8473.

Повний текст джерела

Анотація:

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.

Стилі APA, Harvard, Vancouver, ISO та ін.

9

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 (July 2022): 2640–52. http://dx.doi.org/10.14778/3551793.3551820.

Повний текст джерела

Анотація:

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. Moreover, extension-based methods usually use extra attributes to extend the indexes, resulting in high space costs. To address these issues, we thoroughly compare the two types of methods mentioned above. We also propose a new extension-based approach, Monotonic Landmark Labeling (MLL), to reduce the required space cost while still guaranteeing query time. We compare the performance of different methods on ten large real-world graphs with up to 5.5 billion edges. The experimental results reveal the characteristics of various methods, allowing practitioners to select the appropriate method for a specific application.

Стилі APA, Harvard, Vancouver, ISO та ін.

10

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 (November 8, 2019): 18–32. http://dx.doi.org/10.1145/3372001.3372003.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Книги з теми "Traversal queries"

1

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

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Частини книг з теми "Traversal queries"

1

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, 34–48. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-54832-2_5.

Повний текст джерела

Анотація:

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 reachability queries. (1) Execute a modified version of Dijkstra’s algorithm that supports time-dependent edge traversal costs; this solution is slow since it must expand edge by edge and does not use an index. (2) Issue a separate path query for each single POI, i.e., a single reachability query requires answering many path queries. None of these solutions scales to large networks with many POIs. We propose a novel and lightweight reachability index. The key idea is to partition the network into cells. Then, in contrast to other approaches, we expand the network cell by cell. Empirical evaluations on synthetic and real-world networks confirm the efficiency and the effectiveness of our index-based reachability query solution.

Стилі APA, Harvard, Vancouver, ISO та ін.

2

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, 141–57. Berlin, Heidelberg: Springer Berlin Heidelberg, 2016. http://dx.doi.org/10.1007/978-3-662-49665-7_9.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

3

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

Повний текст джерела

Анотація:

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 participation (for example, to issue queries rather than simply follow hyperlinks) cannot be handled using the simple link traversal techniques used by many web crawlers (Rappaport, 2000; Cho & Garcia-Molina, 2000; Cho et al, 1998; Edwards et al, 2001). This area of the web, which has been operationally off-limits for crawlers using standard indexing procedures, is termed the Deep Web (Zillman, 2005; Bergman, 2000). Much work still needs to be done as Deep Web sites represent an area that is only recently being explored to identify where potential uses can be developed.

Стилі APA, Harvard, Vancouver, ISO та ін.

Тези доповідей конференцій з теми "Traversal queries"

1

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. New York, NY, USA: ACM, 2014. http://dx.doi.org/10.1145/2621934.2621943.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

2

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.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

3

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. New York, NY, USA: ACM, 2019. http://dx.doi.org/10.1145/3297280.3297505.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

4

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.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

5

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}. California: International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/ijcai.2021/640.

Повний текст джерела

Анотація:

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 to efficiently answer AkNN queries. Our experiments on real-world and synthetic data sets show that our techniques outperform existing approaches by more than an order of magnitude in almost all settings.

Стилі APA, Harvard, Vancouver, ISO та ін.

6

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

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

7

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. Valencia: Universitat Politècnica de València, 2019. http://dx.doi.org/10.4995/aniav.2019.9014.

Повний текст джерела

Анотація:

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 Pacto de Adriana (2017) de Lissette Orozco y El Color del Camaleón (2017) de Andrés Lübbert. Ambos, a través de un relato autobiográfico y familiar, indagan en los relatos de perpetradores. Por un lado, Lissette Orozco descubre que su querida tía Chany trabajó para los servicios secretos chilenos (DINA), y está actualmente acusada de haber cometido crímenes de lesa humanidad; y, por otro lado, Andrés Lübbert decide buscar los orígenes del trauma de su padre, quien fue capturado por la DINA y sometido a entrenamiento militar en contra de su voluntad. A través de ambas películas, es posible ver cómo la primera persona y la autobiografía, son conceptos que se entrelazan con la historia política de un país. En un diálogo constante con el pasado, ambos directores establecen estrategias narrativas para acercase a las ideas de confrontación, reconciliación o reparación, según sea el caso. Entonces surge la pregunta acerca de la subjetividad y de la autobiografía como un espacio político que pueda trascender del yo. De esta manera, los estudios de performance de Diana Taylor, pueden servirnos para establecer una alianza con el lenguaje audiovisual. En este trabajo, buscaremos dilucidar en qué sentido podría la performatividad otorgar un carácter político al lenguaje audiovisual.

Стилі APA, Harvard, Vancouver, ISO та ін.

Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!