Conecte-se

Bibliografias temáticas / Regular queries / Artigos de revistas

Siga este link para ver outros tipos de publicações sobre o tema: Regular queries.

Artigos de revistas sobre o tema "Regular queries"

Autor: Grafiati

Publicado: 22 de fevereiro de 2025

Última modificação: 28 de julho de 2025

Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos

Selecione um tipo de fonte:

Veja os 50 melhores artigos de revistas para estudos sobre o assunto "Regular queries".

Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.

Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.

Veja os artigos de revistas das mais diversas áreas científicas e compile uma bibliografia correta.

1

Grahne, Gösta, Alex Thomo, and William W. Wadge. "Preferential Regular Path Queries." Fundamenta Informaticae 89, no. 2-3 (2008): 259–88. https://doi.org/10.3233/fun-2008-892-304.

Texto completo da fonte

Resumo:

In this paper, we introduce preferential regular path queries. These are regular path queries whose symbols are annotated with preference weights for "scaling" up or down the intrinsic importance of matching a symbol against a (semistructured) database edge label. Annotated regular path queries are expressed syntactically as annotated regular expressions. We interpret these expressions in a uniform semiring framework, which allows different semantic interpretations for the same syntactic annotations. For our preference queries, we study three important aspects: (1) (progressive) query answerin

Estilos ABNT, Harvard, Vancouver, APA, etc.

2

Liu, Yanhong A., Tom Rothamel, Fuxiang Yu, Scott D. Stoller, and Nanjun Hu. "Parametric regular path queries." ACM SIGPLAN Notices 39, no. 6 (2004): 219–30. http://dx.doi.org/10.1145/996893.996868.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

3

Calvanese, Diego, Giuseppe De Giacomo, Maurizio Lenzerini, and Moshe Y. Vardi. "Rewriting of Regular Expressions and Regular Path Queries." Journal of Computer and System Sciences 64, no. 3 (2002): 443–65. http://dx.doi.org/10.1006/jcss.2001.1805.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

4

Bosc, Patrick, and Olivier Pivert. "Flexible Queries for Regular Databases." IFAC Proceedings Volumes 31, no. 15 (1998): 619–24. http://dx.doi.org/10.1016/s1474-6670(17)40620-3.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

5

Calvanese, D., G. De Giacomo, M. Lenzerini, and M. Y. Vardi. "Reasoning on regular path queries." ACM SIGMOD Record 32, no. 4 (2003): 83–92. http://dx.doi.org/10.1145/959060.959076.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

6

Reutter, Juan L., Miguel Romero, and Moshe Y. Vardi. "Regular Queries on Graph Databases." Theory of Computing Systems 61, no. 1 (2016): 31–83. http://dx.doi.org/10.1007/s00224-016-9676-2.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

7

Abiteboul, Serge, and Victor Vianu. "Regular Path Queries with Constraints." Journal of Computer and System Sciences 58, no. 3 (1999): 428–52. http://dx.doi.org/10.1006/jcss.1999.1627.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

8

Figueira, Diego, Rémi Morvan, and Miguel Romero. "Minimizing Conjunctive Regular Path Queries." Proceedings of the ACM on Management of Data 3, no. 2 (2025): 1–25. https://doi.org/10.1145/3725237.

Texto completo da fonte

Resumo:

We study the minimization problem for Conjunctive Regular Path Queries (CRPQs) and unions of CRPQs (UCRPQs). This is the problem of checking, given a query and a number k , whether the query is equivalent to one of size at most k . For CRPQs we consider the size to be the number of atoms, and for UCRPQs the maximum number of atoms in a CRPQ therein, motivated by the fact that the number of atoms has a leading influence on the cost of query evaluation. We show that the minimization problem is decidable, both for CRPQs and UCRPQs. We provide a 2ExpSpace upper-bound for CRPQ minimization, based o

Estilos ABNT, Harvard, Vancouver, APA, etc.

9

Chauhan, Komal, Kartik Jain, Sayan Ranu, Srikanta Bedathur, and Amitabha Bagchi. "Answering regular path queries through exemplars." Proceedings of the VLDB Endowment 15, no. 2 (2021): 299–311. http://dx.doi.org/10.14778/3489496.3489510.

Texto completo da fonte

Resumo:

Regular simple path query (RPQ) is one of the fundamental operators in graph analytics. In an RPQ, the input is a graph, a source node and a regular expression. The goal is to identify all nodes that are connected to the source through a simple path whose label sequence satisfies the given regular expression. The regular expression acts as a formal specification of the search space that is of interest to the user. Although regular expressions have high expressive power, they act as barrier to non-technical users. Furthermore, to fully realize the power of regular expressions, the user must be

Estilos ABNT, Harvard, Vancouver, APA, etc.

10

Tetzel, Frank, Wolfgang Lehner, and Romans Kasperovics. "Efficient Compilation of Regular Path Queries." Datenbank-Spektrum 20, no. 3 (2020): 243–59. http://dx.doi.org/10.1007/s13222-020-00353-9.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

11

Grahne, Gösta, and Alex Thomo. "Regular path queries under approximate semantics." Annals of Mathematics and Artificial Intelligence 46, no. 1-2 (2006): 165–90. http://dx.doi.org/10.1007/s10472-005-9016-8.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

12

Zhang, Ling, Shaleen Deep, Avrilia Floratou, Anja Gruenheid, Jignesh M. Patel, and Yiwen Zhu. "Exploiting Structure in Regular Expression Queries." Proceedings of the ACM on Management of Data 1, no. 2 (2023): 1–28. http://dx.doi.org/10.1145/3589297.

Texto completo da fonte

Resumo:

Regular expression, or regex, is widely used to extract critical information from a large corpus of formatted text by finding patterns of interest. In tasks like log processing, the speed of regex matching is crucial. Data scientists and developers regularly use regex libraries that implement optimized regular expression matching using modern automata theory. However, computing state transitions in the underlying regex evaluation engine can be inefficient when a regex query contains a multitude of string literals. This inefficiency is further exasperated when analyzing large data volumes. This

Estilos ABNT, Harvard, Vancouver, APA, etc.

13

Bienvenu, Meghyn, Magdalena Ortiz, and Mantas Simkus. "Regular Path Queries in Lightweight Description Logics: Complexity and Algorithms." Journal of Artificial Intelligence Research 53 (July 22, 2015): 315–74. http://dx.doi.org/10.1613/jair.4577.

Texto completo da fonte

Resumo:

Conjunctive regular path queries are an expressive extension of the well-known class of conjunctive queries. Such queries have been extensively studied in the (graph) database community, since they support a controlled form of recursion and enable sophisticated path navigation. Somewhat surprisingly, there has been little work aimed at using such queries in the context of description logic (DL) knowledge bases, particularly for the lightweight DLs that are considered best suited for data-intensive applications. This paper aims to bridge this gap by providing algorithms and tight complexity bou

Estilos ABNT, Harvard, Vancouver, APA, etc.

14

Fernández Gil, Oliver, and Anni-Yasmin Turhan. "Answering Regular Path Queries Under Approximate Semantics in Lightweight Description Logics." Proceedings of the AAAI Conference on Artificial Intelligence 35, no. 7 (2021): 6340–48. http://dx.doi.org/10.1609/aaai.v35i7.16787.

Texto completo da fonte

Resumo:

Classical regular path queries (RPQs) can be too restrictive for some applications and answering such queries under approximate semantics to relax the query is desirable. While for answering regular path queries over graph databases under approximate semantics algorithms are available, such algorithms are scarce for the ontology-mediated setting. In this paper we extend an approach for answering RPQs over graph databases that uses weighted transducers to approximate paths from the query in two ways. The first extension is to answering approximate conjunctive 2-way regular path queries (C2RPQs)

Estilos ABNT, Harvard, Vancouver, APA, etc.

15

Niehren, Joachim, Sylvain Salvati, and Rustam Azimov. "Jumping Evaluation of Nested Regular Path Queries." Electronic Proceedings in Theoretical Computer Science 364 (August 4, 2022): 79–92. http://dx.doi.org/10.4204/eptcs.364.8.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

16

Mazowiecki, Filip, Filip Murlak, and Adam Witkowski. "Monadic Datalog and Regular Tree Pattern Queries." ACM Transactions on Database Systems 41, no. 3 (2016): 1–43. http://dx.doi.org/10.1145/2925986.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

17

Martens, Wim, and Tina Trautner. "Dichotomies for Evaluating Simple Regular Path Queries." ACM Transactions on Database Systems 44, no. 4 (2019): 1–46. http://dx.doi.org/10.1145/3331446.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

18

Grahne, Gösta, and Alex Thomo. "Algebraic rewritings for optimizing regular path queries." Theoretical Computer Science 296, no. 3 (2003): 453–71. http://dx.doi.org/10.1016/s0304-3975(02)00739-9.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

19

Flesca, Sergio, and Sergio Greco. "Partially ordered regular languages for graph queries." Journal of Computer and System Sciences 70, no. 1 (2005): 1–25. http://dx.doi.org/10.1016/j.jcss.2003.04.003.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

20

Angluin, Dana. "Learning regular sets from queries and counterexamples." Information and Computation 75, no. 2 (1987): 87–106. http://dx.doi.org/10.1016/0890-5401(87)90052-6.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

21

Abo Khamis, Mahmoud, Ahmet Kara, Dan Olteanu, and Dan Suciu. "Output-Sensitive Evaluation of Regular Path Queries." Proceedings of the ACM on Management of Data 3, no. 2 (2025): 1–20. https://doi.org/10.1145/3725242.

Texto completo da fonte

Resumo:

We study the classical evaluation problem for regular path queries: Given an edge-labeled graph and a regular path query, compute the set of pairs of vertices that are connected by paths that match the query. The Product Graph (PG) is the established evaluation approach for regular path queries. PG first constructs the product automaton of the data graph and the query and then uses breadth-first search to find the accepting states reachable from each initial state in the product automaton. Its data complexity is O(|V|⋅|E|), where V and E are the sets of vertices and respectively edges in the d

Estilos ABNT, Harvard, Vancouver, APA, etc.

22

BONIFATI, ANGELA, STEFANIA DUMBRAVA, and EMILIO JESÚS GALLEGO ARIAS. "Certified Graph View Maintenance with Regular Datalog." Theory and Practice of Logic Programming 18, no. 3-4 (2018): 372–89. http://dx.doi.org/10.1017/s1471068418000224.

Texto completo da fonte

Resumo:

AbstractWe employ the Coq proof assistant to develop a mechanically-certified framework for evaluating graph queries and incrementally maintaining materialized graph instances, also called views. The language we use for defining queries and views is Regular Datalog (RD) – a notable fragment of non-recursive Datalog that can express complex navigational queries, with transitive closure as native operator. We first design and encode the theory of RD and then mechanize a RD-specific evaluation algorithm capable of fine-grained, incremental graph view computation, which we prove sound with respect

Estilos ABNT, Harvard, Vancouver, APA, etc.

23

Shoaran, Maryam, and Alex Thomo. "Fault-tolerant computation of distributed regular path queries." Theoretical Computer Science 410, no. 1 (2009): 62–77. http://dx.doi.org/10.1016/j.tcs.2008.09.061.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

24

Klassen, R. K., and I. A. Kazantsev. "AUTOMATICAL PRETRANSLATION OF SQL-QUERIES TO A REGULAR PLAN IN CLUSTERIX-LIKE DBMS." Vestnik komp'iuternykh i informatsionnykh tekhnologii, no. 196 (October 2020): 11–20. http://dx.doi.org/10.14489/vkit.2020.10.pp.011-020.

Texto completo da fonte

Resumo:

Previously completed designs for pretranslating SQL queries did not bring significant success. Nevertheless, such a pretranslator is necessary for the possibility of using Clusterix-like database management systems (DBMSs) by a wide circle of specialists. The article proposes an original approach to pretranslating SQL queries without writing operations to the regular plan for Clusterix-like DBMSs. The possibility of implementing such a pretranslator is discussed. The concepts of a hard and a simple SQL query are given. The basis of the pretranslator is a library for parsing arbitrary grammars

Estilos ABNT, Harvard, Vancouver, APA, etc.

25

Klassen, R. K., and I. A. Kazantsev. "AUTOMATICAL PRETRANSLATION OF SQL-QUERIES TO A REGULAR PLAN IN CLUSTERIX-LIKE DBMS." Vestnik komp'iuternykh i informatsionnykh tekhnologii, no. 196 (October 2020): 11–20. http://dx.doi.org/10.14489/vkit.2020.10.pp.011-020.

Texto completo da fonte

Resumo:

Previously completed designs for pretranslating SQL queries did not bring significant success. Nevertheless, such a pretranslator is necessary for the possibility of using Clusterix-like database management systems (DBMSs) by a wide circle of specialists. The article proposes an original approach to pretranslating SQL queries without writing operations to the regular plan for Clusterix-like DBMSs. The possibility of implementing such a pretranslator is discussed. The concepts of a hard and a simple SQL query are given. The basis of the pretranslator is a library for parsing arbitrary grammars

Estilos ABNT, Harvard, Vancouver, APA, etc.

26

Park, Sungwoo, Seyeon Oh, and Min-Soo Kim. "cuMatch: A GPU-based Memory-Efficient Worst-case Optimal Join Processing Method for Subgraph Queries with Complex Patterns." Proceedings of the ACM on Management of Data 3, no. 3 (2025): 1–28. https://doi.org/10.1145/3725398.

Texto completo da fonte

Resumo:

Subgraph queries are widely used but face significant challenges due to complex patterns such as negative and optional edges. While worst-case optimal joins have proven effective for subgraph queries with regular patterns, no method has been proposed that can process queries involving complex patterns in a single multi-way join. Existing CPU-based and GPU-based methods experience intermediate data explosion when processing complex patterns following regular patterns. In addition, GPU-based methods struggle with issues of wasted GPU memory and redundant computation. In this paper, we propose cu

Estilos ABNT, Harvard, Vancouver, APA, etc.

27

Dimartino, Mirko M., Peter T. Wood, Andrea Cali, and Alexandra Poulovassilis. "Efficient Ontology-Mediated Query Answering: Extending DL-liteR and Linear ELH." Journal of Artificial Intelligence Research 82 (February 11, 2025): 851–99. https://doi.org/10.1613/jair.1.16401.

Texto completo da fonte

Resumo:

The OWL 2 QL profile of the OWL 2 Web Ontology Language, based on the family of description logics called DL-Lite, is designed so that data stored in a standard relational database system (RDBMS) can be queried through an ontology via a rewriting mechanism, i.e., by rewriting the query into an SQL query that is then answered by the RDBMS system, without any changes to the data. In this paper we propose a language whose expressive power goes beyond that of DL-Lite while still allowing query answering via rewriting of queries into unions of conjunctive two-way regular path queries (UC2RPQs) inst

Estilos ABNT, Harvard, Vancouver, APA, etc.

28

Guo, Xintong, Hong Gao, and Zhaonian Zou. "Distributed processing of regular path queries in RDF graphs." Knowledge and Information Systems 63, no. 4 (2021): 993–1027. http://dx.doi.org/10.1007/s10115-020-01536-2.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

29

Lee, Jinsoo, Minh-Duc Pham, Jihwan Lee, et al. "Processing SPARQL queries with regular expressions in RDF databases." BMC Bioinformatics 12, Suppl 2 (2011): S6. http://dx.doi.org/10.1186/1471-2105-12-s2-s6.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

30

Liang, Qi, Dian Ouyang, Fan Zhang, Jianye Yang, Xuemin Lin, and Zhihong Tian. "Efficient Regular Simple Path Queries under Transitive Restricted Expressions." Proceedings of the VLDB Endowment 17, no. 7 (2024): 1710–22. http://dx.doi.org/10.14778/3654621.3654636.

Texto completo da fonte

Resumo:

There are two fundamental problems in regular simple path queries (RSPQs). One is the reachability problem which asks whether there exists a simple path between the source and the target vertex matching the given regular expression, and the other is the enumeration problem which aims to find all the matched simple paths. As an important computing component of graph databases, RSPQs are supported in many graph database query languages such as PGQL and openCypher. However, answering RSPQs is known to be NP-hard, making it challenging to design scalable solutions to support a wide range of expres

Estilos ABNT, Harvard, Vancouver, APA, etc.

31

Fan, Wenfei, Jianzhong Li, Shuai Ma, Nan Tang, and Yinghui Wu. "Adding regular expressions to graph reachability and pattern queries." Frontiers of Computer Science 6, no. 3 (2012): 313–38. http://dx.doi.org/10.1007/s11704-012-1312-y.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

32

Grahne, Gösta, and Alex Thomo. "Bounded regular path queries in view-based data integration." Information Processing Letters 109, no. 13 (2009): 739–44. http://dx.doi.org/10.1016/j.ipl.2009.03.011.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

33

Bagan, Guillaume, Angela Bonifati, and Benoit Groz. "A trichotomy for regular simple path queries on graphs." Journal of Computer and System Sciences 108 (March 2020): 29–48. http://dx.doi.org/10.1016/j.jcss.2019.08.006.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

34

Ginsburg, Seymour, and X. Sean Wang. "Regular Sequence Operations and Their Use in Database Queries." Journal of Computer and System Sciences 56, no. 1 (1998): 1–26. http://dx.doi.org/10.1006/jcss.1997.1514.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

35

Amarilli, Antoine, Wolfgang Gatterbauer, Neha Makhija, and Mikaël Monet. "Resilience for Regular Path Queries: Towards a Complexity Classification." Proceedings of the ACM on Management of Data 3, no. 2 (2025): 1–18. https://doi.org/10.1145/3725245.

Texto completo da fonte

Resumo:

The resilience problem for a query and an input set or bag database is to compute the minimum number of facts to remove from the database to make the query false. In this paper, we study how to compute the resilience of Regular Path Queries (RPQs) over graph databases. Our goal is to characterize the regular languages L for which it is tractable to compute the resilience of the existentially-quantified RPQ built from L . We show that computing the resilience in this sense is tractable (even in combined complexity) for all RPQs defined from so-called local languages . By contrast, we show hardn

Estilos ABNT, Harvard, Vancouver, APA, etc.

36

Purtzel, Steven, and Matthias Weidlich. "SuSe: Summary Selection for Regular Expression Subsequence Aggregation over Streams." Proceedings of the ACM on Management of Data 3, no. 3 (2025): 1–27. https://doi.org/10.1145/3725359.

Texto completo da fonte

Resumo:

Regular expressions (RegEx) are an essential tool for pattern matching over streaming data, e.g., in network and security applications. The evaluation of RegEx queries becomes challenging, though, once subsequences are incorporated, i.e., characters in a sequence may be skipped during matching. Since the number of subsequence matches may grow exponentially in the input length, existing RegEx engines fall short in finding all subsequence matches, especially for queries including Kleene closure. In this paper, we argue that common applications for RegEx queries over streams do not require the en

Estilos ABNT, Harvard, Vancouver, APA, etc.

37

Prezza, Nicola. "Subpath Queries on Compressed Graphs: A Survey." Algorithms 14, no. 1 (2021): 14. http://dx.doi.org/10.3390/a14010014.

Texto completo da fonte

Resumo:

Text indexing is a classical algorithmic problem that has been studied for over four decades: given a text T, pre-process it off-line so that, later, we can quickly count and locate the occurrences of any string (the query pattern) in T in time proportional to the query’s length. The earliest optimal-time solution to the problem, the suffix tree, dates back to 1973 and requires up to two orders of magnitude more space than the plain text just to be stored. In the year 2000, two breakthrough works showed that efficient queries can be achieved without this space overhead: a fast index be stored

Estilos ABNT, Harvard, Vancouver, APA, etc.

38

TAN, TONY, and DOMAGOJ VRGOČ. "REGULAR EXPRESSIONS FOR QUERYING DATA GRAPHS." International Journal of Foundations of Computer Science 25, no. 08 (2014): 971–85. http://dx.doi.org/10.1142/s0129054114400188.

Texto completo da fonte

Resumo:

The standard regular expressions over finite alphabets have been widely accepted as the most basic formalism to query graph databases. However, the major drawback of this approach is that it ignores the presence of data. In this paper we study the so called regular expressions with binding (REWB), that is, regular expressions equipped with variables to store data within a well defined scope. In particular, we study the complexity of the query evaluation of REWB queries over graph databases.

Estilos ABNT, Harvard, Vancouver, APA, etc.

39

Nguyen, Van-Quyet, Van-Hau Nguyen, Minh-Quy Nguyen, Quyet-Thang Huynh, and Kyungbaek Kim. "Efficiently Estimating Joining Cost of Subqueries in Regular Path Queries." Electronics 10, no. 9 (2021): 990. http://dx.doi.org/10.3390/electronics10090990.

Texto completo da fonte

Resumo:

Evaluating Regular Path Queries (RPQs) have been of interest since they were used as a powerful way to explore paths and patterns in graph databases. Traditional automata-based approaches are restricted in the graph size and/or highly complex queries, which causes a high evaluation cost (e.g., memory space and response time) on large graphs. Recently, although using the approach based on the threshold rare label for large graphs has been achieving some success, they could not often guarantee the minimum searching cost. Alternatively, the Unit-Subquery Cost Matrix (USCM) has been studied and ob

Estilos ABNT, Harvard, Vancouver, APA, etc.

40

Alon, Noga, Michael Krivelevich, Ilan Newman, and Mario Szegedy. "Regular Languages are Testable with a Constant Number of Queries." SIAM Journal on Computing 30, no. 6 (2001): 1842–62. http://dx.doi.org/10.1137/s0097539700366528.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

41

Alkhateeb, Faisal, and Jerome Euzenat. "Constrained regular expressions for answering RDF-path queries modulo RDFS." International Journal of Web Information Systems 10, no. 1 (2014): 24–50. http://dx.doi.org/10.1108/ijwis-05-2013-0013.

Texto completo da fonte

Resumo:

Purpose – The paper aims to discuss extensions of SPARQL that use regular expressions to navigate RDF graphs and may be used to answer queries considering RDFS semantics (in particular, nSPARQL and our proposal CPSPARQL). Design/methodology/approach – The paper is based upon a theoretical comparison of the expressiveness and complexity of both nSPARQL and the corresponding fragment of CPSPARQL, that we call cpSPARQL. Findings – The paper shows that nSPARQL and cpSPARQL (the fragment of CPSPARQL) have the same complexity through cpSPARQL, being a proper extension of SPARQL graph patterns, is mo

Estilos ABNT, Harvard, Vancouver, APA, etc.

42

Inaba, Kazuhiro, and Haruo Hosoya. "Compact representation for answer sets of n-ary regular queries." Theoretical Computer Science 411, no. 38-39 (2010): 3481–92. http://dx.doi.org/10.1016/j.tcs.2010.05.026.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

43

Freydenberger, Dominik D., and Nicole Schweikardt. "Expressiveness and static analysis of extended conjunctive regular path queries." Journal of Computer and System Sciences 79, no. 6 (2013): 892–909. http://dx.doi.org/10.1016/j.jcss.2013.01.008.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

44

Huang, Yifei, Matin Amini, Alexis Le Glaunec, Konstantinos Mamouras, and Mukund Raghothaman. "Membership Testing for Semantic Regular Expressions." Proceedings of the ACM on Programming Languages 9, PLDI (2025): 1245–68. https://doi.org/10.1145/3729300.

Texto completo da fonte

Resumo:

This paper is about semantic regular expressions (SemREs). This is a concept that was recently proposed by Smore (Chen et al. 2023) in which classical regular expressions are extended with a primitive to query external oracles such as databases and large language models (LLMs). SemREs can be used to identify lines of text containing references to semantic concepts such as cities, celebrities, political entities, etc. The focus in their paper was on automatically synthesizing semantic regular expressions from positive and negative examples. In this paper, we study the membership testing problem

Estilos ABNT, Harvard, Vancouver, APA, etc.

45

Metre, K. V. "Location based Continuous Query Processing over Geo-streaming Data." Turkish Journal of Computer and Mathematics Education (TURCOMAT) 12, no. 1S (2021): 106–14. http://dx.doi.org/10.17762/turcomat.v12i1s.1583.

Texto completo da fonte

Resumo:

In recent years, many data-intensive and location based applications have emerged that need to process stream data in applications such as network monitoring, telecommunications data management, and sensor networks. Unlike regular queries, a continuous query exists for certain period of time and need to be continuously processed during this time. The algorithms used for data processing for the traditional database systems are not suited to tackle complex and various continuous queries over dynamic streaming data. The indexing for finite queries is preferred to indexing on infinite data to avoi

Estilos ABNT, Harvard, Vancouver, APA, etc.

46

Gibney, Daniel, and Sharma V. Thankachan. "Text Indexing for Regular Expression Matching." Algorithms 14, no. 5 (2021): 133. http://dx.doi.org/10.3390/a14050133.

Texto completo da fonte

Resumo:

Finding substrings of a text T that match a regular expression p is a fundamental problem. Despite being the subject of extensive research, no solution with a time complexity significantly better than O(|T||p|) has been found. Backurs and Indyk in FOCS 2016 established conditional lower bounds for the algorithmic problem based on the Strong Exponential Time Hypothesis that helps explain this difficulty. A natural question is whether we can improve the time complexity for matching the regular expression by preprocessing the text T? We show that conditioned on the Online Matrix–Vector Multiplica

Estilos ABNT, Harvard, Vancouver, APA, etc.

47

Kazantsev, I. A., and R. K. Klassen. "IMPROVING THE AUTOMATIC PRETANSLATOR OF SQL-QUERIES TO A REGULAR PLAN." Vestnik komp'iuternykh i informatsionnykh tekhnologii, no. 210 (December 2021): 3–12. http://dx.doi.org/10.14489/vkit.2021.12.pp.003-012.

Texto completo da fonte

Resumo:

We have created an automatic pretranslator prototype and proposing a new approach to improve the automatic pretranslator efficiency by parsing the original SQL (Structured Query Language) query and building a regular tree. The new approach is to create custom handlers for specific SQL constructs. The resulting handlers, instead of omitting some SQL constructs at the sorting and aggregation stage, allow them to be processed at the join stage. Joining operations, in contrast to sorting and aggregation operations, are performed in parallel on several nodes of the computing cluster, which signific

Estilos ABNT, Harvard, Vancouver, APA, etc.

48

Chockler, Hana, та Orna Kupferman. "ω-Regular languages are testable with a constant number of queries". Theoretical Computer Science 329, № 1-3 (2004): 71–92. http://dx.doi.org/10.1016/j.tcs.2004.08.004.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

49

Bhrugubanda, Meenakshi. "Analysis of hybrid approach for Answering holistic queries in Wireless Sensor." International Journal of Engineering Technology and Management Sciences 4, no. 5 (2020): 53–56. http://dx.doi.org/10.46647/ijetms.2020.v04i05.010.

Texto completo da fonte

Resumo:

Sensor networks are greatly utilized in unique areas like the transportation methods, wellbeing monitoring, soil monitoring, habitat monitoring and so forth. Clients pose queries to sensors and acquire sensing information. In view of the low quality detecting devices, sensor information is regularly boisterous. Continuous queries are more commonly employed to increase the reliability of query result. On this work we revolve round on regular holistic queries like Median. Present methodologies are for essentially the most phase supposed for non-holistic queries like Average. As a result of the n

Estilos ABNT, Harvard, Vancouver, APA, etc.

50

Pang, Yue, Lei Zou, Jeffrey Xu Yu, and Linglin Yang. "Materialized View Selection & View-Based Query Planning for Regular Path Queries." Proceedings of the ACM on Management of Data 2, no. 3 (2024): 1–26. http://dx.doi.org/10.1145/3654955.

Texto completo da fonte

Resumo:

A regular path query (RPQ) returns node pairs connected by a path whose edge label sequence satisfies the given regular expression. Given a workload of RPQs, selecting the shared subqueries as materialized views to precompute offline can speed up the online processing. Since the available memory is limited, we define the materialized view selection (MVS) problem for RPQs as minimizing the total workload query cost within a memory budget. To tackle the problem's NP-hardness, we design an efficient MVS algorithm based on heuristics. To prevent redundancies in the selected views, we devise the AN

Estilos ABNT, Harvard, Vancouver, APA, etc.

Oferecemos descontos em todos os planos premium para autores cujas obras estão incluídas em seleções literárias temáticas. Contate-nos para obter um código promocional único!