Bibliografias temáticas / Regular queries

Índice

Artigos de revistas
Teses / dissertações
Livros
Capítulos de livros
Trabalhos de conferências
Relatórios de organizações

Literatura científica selecionada 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:

Consulte a lista de atuais artigos, livros, teses, anais de congressos e outras fontes científicas relevantes para o tema "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.

Artigos de revistas sobre o assunto "Regular queries"

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

Mais fontes

Teses / dissertações sobre o assunto "Regular queries"

Al, Serhali Antonio. "Earliest Query Answering for Regular Queries with Complete Subhedge Projection." Electronic Thesis or Diss., Université de Lille (2022-....), 2024. http://www.theses.fr/2024ULILB037.

Texto completo da fonte

Resumo:

Les requêtes logiques sont au cœur des bases de données graphes, du traitementd'événements complexes et du traitement de flux Xml. L'efficacité des algorithmesde réponse à ces requêtes est cruciale en pratique, malgré la complexité théoriqueinhérente du problème algorithmique sous-jacent, qui exclut toute solution à la foispleinement générale et efficace.Nous réexaminons le problème de la réponse au plus tôt aux requêtes régulièressur des séquences d'arbres de données, souvent appelées haies. Ce problème a étéétudié pour la première fois par Gauwin et al. en 2011. Leur motivation initiale,qui

Estilos ABNT, Harvard, Vancouver, APA, etc.

Boher, Genís Pau. "Functional genomics of the periderm: the biosynthetic gene FHT, the transcriptional regulator StRiK and the transcriptome deciphering." Doctoral thesis, Universitat de Girona, 2017. http://hdl.handle.net/10803/403400.

Texto completo da fonte

Resumo:

We have developed new molecular tools to characterize the FHT and StRIK genes in the tuber periderm. Regarding FHT gene, our results demonstrated that is induced very specifically in suberizing tissues what makes FHT a good marker of the suberization process. Regarding StRIK gene, it has been shown to be a good candidate for the periderm regulation since its silencing causes changes in genes expression related to the transposition of DNA, RNA processing and stress. Finally, by RNA-seq we have identified a wide range of new candidate genes for the formation of the cork oak periderm. Among these

Estilos ABNT, Harvard, Vancouver, APA, etc.

Shoaran, Maryam. "Distributed multi-source regular path queries." Thesis, 2007. http://hdl.handle.net/1828/2471.

Texto completo da fonte

Resumo:

Regular path queries are the building block of almost any mechanism for querying semistructured data. Despite the fact that the main applications of such data are distributed, there are only few works dealing with distributed evaluation of regular path queries. In this thesis we present a message-efficient and truly distributed algorithm for computing the answer to regular path queries in a multi-source semistructured database setting. Our algorithm has several desirable properties. First, it is general as it works for the larger class of weighted regular path queries on weighted semistructur

Estilos ABNT, Harvard, Vancouver, APA, etc.

Miao, Zhuo. "Grid-aware evaluation of regular path queries on large Spatial networks." Thesis, 2007. http://hdl.handle.net/1828/192.

Texto completo da fonte

Resumo:

Regular path queries (RPQs), expressed as regular expressions over the alphabet of database edge-labels, are commonly used for guided navigation of graph databases. RPQs are the basic building block of almost all the query languages for graph databases, providing the user with a nice and simple way to express recursion. While convenient to use, RPQs are notorious for their high computational demand. Except for few theoretical works, there has been little work evaluating RPQs on databases of great practical interest, such as large spatial networks. In this thesis, we present a grid-aware, f

Estilos ABNT, Harvard, Vancouver, APA, etc.

Tamashiro, Manuel. "Towards practically feasible answering of regular path queries in LAV data integration." Thesis, 2007. http://hdl.handle.net/1828/129.

Texto completo da fonte

Resumo:

Regular path queries (RPQ’s) are given by means of regular expressions and ask for matching patterns on labeled graphs. RPQ’s have recently received great attention in the context of semistructured data, which are data whose structure is irregular, partially known, or subject to frequent changes. One of the most important problems in databases today is the integration of semistructured data from multiple sources modeled as views. In this setting, the database is not available, and given a user query, the system has to answer based solely on the information provided by the views. The pro

Estilos ABNT, Harvard, Vancouver, APA, etc.

Wen-GanLi and 李文淦. "FulDex: A Fully-Indexing-Enabled Memory Representation Model for Supporting XML Regular Expression Queries." Thesis, 2015. http://ndltd.ncl.edu.tw/handle/43178941967819820797.

Texto completo da fonte

Resumo:

碩士<br>國立成功大學<br>資訊工程學系<br>103<br>XML has been widely used in the field of service computing because of its simplicity, generality and usability. In general, there are two phases in processing an XML document: parsing the XML document and querying over the XML document. However, querying over XML documents with regular expressions is a time intensive process. Although efforts have been made on optimizing regular expression string matchings and XML queries based on database, little emphasis has been put on optimizing XML regular expression queries based on memory representations. In this work, w

Estilos ABNT, Harvard, Vancouver, APA, etc.

Shoaran, Maryam. "Automata methods and techniques for graph-structured data." Thesis, 2011. http://hdl.handle.net/1828/3249.

Texto completo da fonte

Resumo:

Graph-structured data (GSD) is a popular model to represent complex information in a wide variety of applications such as social networks, biological data management, digital libraries, and traffic networks. The flexibility of this model allows the information to evolve and easily integrate with heterogeneous data from many sources. In this dissertation we study three important problems on GSD. A consistent theme of our work is the use of automata methods and techniques to process and reason about GSD. First, we address the problem of answering queries on GSD in a distributed environme

Estilos ABNT, Harvard, Vancouver, APA, etc.

Livros sobre o assunto "Regular queries"

Brocki, Marcin, Małgorzata Maj, and Stanisława Trebunia-Staszel, eds. Anthropology and Ethnology During World War II. The Activity of Sektion Rassen- und Volkstumsforschung Institut für Deutsche Ostarbeit in the Light of New Source Materials. Wydawnictwo Uniwersytetu Jagiellońskiego, 2019. http://dx.doi.org/10.4467/k9915.19/19.19.15528.

Texto completo da fonte

Resumo:

After reading this voluminous and, contrary to what the title might suggest, engaging study, I have no doubt that it is a great scientific achievement. Firstly, the authors managed to develop an approach to the otherwise sensitive subject of the IDO heritage that enables a cool, albeit not entirely distanced way of looking at the history of a certain institution, as well as at the entanglement of many people in its activity. The fact that the institution was established in dark times, and, in addition, by Hans Frank, should not a priori put it in the context of regular Nazi propaganda and dege

Estilos ABNT, Harvard, Vancouver, APA, etc.

The Rector of Dr---r's case concerning the power of suspension from the sacrament stated: In a letter from his friend : wherein the three following queries are briefly examined, and modestly resolved, viz. I. Whether a rector hath power to suspend any of the parishioners committed to his charge, from a temporary reception of the sacrament?, and in what cases he may exercise that power?, II. What is the bishops office in such a case?, and whether he may restore such persons so suspended, without a judicial cognizance of the crime objected?, III. Whether in such a case the bishop may regularly command the rector, and whether such commands are obliging? Printed for Edward Mory ... and sold by M. Gunne ..., 1985.

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Capítulos de livros sobre o assunto "Regular queries"

Liu, Yanhong A., and Fuxiang Yu. "Solving Regular Path Queries." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45442-x_12.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

de Moor, Oege, David Lacey, and Eric Van Wyk. "Universal Regular Path Queries." In Automatic Program Development. Springer Netherlands, 2008. http://dx.doi.org/10.1007/978-1-4020-6585-9_11.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Grahne, Gösta, Alex Thomo, and William Wadge. "Preferentially Annotated Regular Path Queries." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11965893_22.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Ferretti, Claudio, and Giancarlo Mauri. "Identifying unrecognizable regular languages by queries." In Machine Learning: ECML-94. Springer Berlin Heidelberg, 1994. http://dx.doi.org/10.1007/3-540-57868-4_72.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Koschmieder, André, and Ulf Leser. "Regular Path Queries on Large Graphs." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-31235-9_12.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Bosc, Patrick, and Olivier Pivert. "Fuzzy Queries Against Regular and Fuzzy Databases." In Flexible Query Answering Systems. Springer US, 1997. http://dx.doi.org/10.1007/978-1-4615-6075-3_10.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Stefanescu, Dan, and Alex Thomo. "Enhanced Regular Path Queries on Semistructured Databases." In Current Trends in Database Technology – EDBT 2006. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11896548_53.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Flesca, Sergio, and Sergio Greco. "Partially Ordered Regular Languages for Graph Queries." In Automata, Languages and Programming. Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-48523-6_29.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Grahne, Gösta, and Alex Thomo. "Algebraic Rewritings for Optimizing Regular Path Queries." In Database Theory — ICDT 2001. Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-44503-x_19.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Mazowiecki, Filip, Filip Murlak, and Adam Witkowski. "Monadic Datalog and Regular Tree Pattern Queries." In Mathematical Foundations of Computer Science 2014. Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-662-44522-8_36.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Trabalhos de conferências sobre o assunto "Regular queries"

Figueira, Diego, S. Krishna, Om Swostik Mishra, and Anantha Padmanabha. "Boundedness for Unions of Conjunctive Regular Path Queries over Simple Regular Expressions." In 21st International Conference on Principles of Knowledge Representation and Reasoning {KR-2023}. International Joint Conferences on Artificial Intelligence Organization, 2024. http://dx.doi.org/10.24963/kr.2024/34.

Texto completo da fonte

Resumo:

The problem of whether a recursive query can be rewritten as query without recursion is a fundamental reasoning task, known as the boundedness problem. Here we study the boundedness problem for Unions of Conjunctive Regular Path Queries (UCRPQs), a navigational query language extensively used in ontology and graph database querying. The boundedness problem for UCRPQs is known to be decidable, ExpSpace-complete. Here we focus our analysis on UCRPQs using simple regular expressions, which are of high practical relevance and enjoy a lower reasoning complexity. We show that the complexity for the

Estilos ABNT, Harvard, Vancouver, APA, etc.

Ostropolski-Nalewaja, Piotr, and Sebastian Rudolph. "The Sticky Path to Expressive Querying: Decidability of Navigational Queries under Existential Rules." In 21st International Conference on Principles of Knowledge Representation and Reasoning {KR-2023}. International Joint Conferences on Artificial Intelligence Organization, 2024. http://dx.doi.org/10.24963/kr.2024/54.

Texto completo da fonte

Resumo:

Extensive research in the field of ontology-based query answering has led to the identification of numerous fragments of existential rules (also known as tuple-generating dependencies) that exhibit decidable answering of atomic and conjunctive queries. Motivated by the increased theoretical and practical interest in navigational queries, this paper considers the question for which of these fragments decidability of querying extends to regular path queries (RPQs). In fact, decidability of RPQs has recently been shown to generally hold for the comprehensive family of all fragments that come with

Estilos ABNT, Harvard, Vancouver, APA, etc.

Liu, Yanhong A., Tom Rothamel, Fuxiang Yu, Scott D. Stoller, and Nanjun Hu. "Parametric regular path queries." In the ACM SIGPLAN 2004 conference. ACM Press, 2004. http://dx.doi.org/10.1145/996841.996868.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Arenas, Marcelo, Pedro Bahamondes, Amir Aghasadeghi, and Julia Stoyanovich. "Temporal Regular Path Queries." In 2022 IEEE 38th International Conference on Data Engineering (ICDE). IEEE, 2022. http://dx.doi.org/10.1109/icde53745.2022.00226.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Calvanese, Diego, Giuseppe De Giacomo, Maurizio Lenzerini, and Moshe Y. Vardi. "Rewriting of regular expressions and regular path queries." In the eighteenth ACM SIGMOD-SIGACT-SIGART symposium. ACM Press, 1999. http://dx.doi.org/10.1145/303976.303996.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Vardi, Moshe Y. "A Theory of Regular Queries." In SIGMOD/PODS'16: International Conference on Management of Data. ACM, 2016. http://dx.doi.org/10.1145/2902251.2902305.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Abiteboul, Serge, and Victor Vianu. "Regular path queries with constraints." In the sixteenth ACM SIGACT-SIGMOD-SIGART symposium. ACM Press, 1997. http://dx.doi.org/10.1145/263661.263676.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Figueira, Diego, Adwait Godbole, S. Krishna, Wim Martens, Matthias Niewerth, and Tina Trautner. "Containment of Simple Conjunctive Regular Path Queries." In 17th International Conference on Principles of Knowledge Representation and Reasoning {KR-2020}. International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/kr.2020/38.

Texto completo da fonte

Resumo:

Testing containment of queries is a fundamental reasoning task in knowledge representation. We study here the containment problem for Conjunctive Regular Path Queries (CRPQs), a navigational query language extensively used in ontology and graph database querying. While it is known that containment of CRPQs is EXPSPACE-complete in general, we focus here on severely restricted fragments, which are known to be highly relevant in practice according to several recent studies. We obtain a detailed overview of the complexity of the containment problem, depending on the features used in the regular ex

Estilos ABNT, Harvard, Vancouver, APA, etc.

Nolé, Maurizio, and Carlo Sartiani. "Regular Path Queries on Massive Graphs." In SSDBM '16: Conference on Scientific and Statistical Database Management. ACM, 2016. http://dx.doi.org/10.1145/2949689.2949711.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, 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.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Relatórios de organizações sobre o assunto "Regular queries"

Gil, Oliver Fernández, and Anni-Yasmin Turhan. Answering Regular Path Queries Under Approximate Semantics in Lightweight Description Logics. Technische Universität Dresden, 2020. http://dx.doi.org/10.25368/2022.261.

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.

Baader, Franz, and Francesco Kriegel. Pushing Optimal ABox Repair from EL Towards More Expressive Horn-DLs: Extended Version. Technische Universität Dresden, 2022. http://dx.doi.org/10.25368/2022.131.

Texto completo da fonte

Resumo:

Ontologies based on Description Logic (DL) represent general background knowledge in a terminology (TBox) and the actual data in an ABox. DL systems can then be used to compute consequences (such as answers to certain queries) from an ontology consisting of a TBox and an ABox. Since both human-made and machine-learned data sets may contain errors, which manifest themselves as unintuitive or obviously incorrect consequences, repairing DL-based ontologies in the sense of removing such unwanted consequences is an important topic in DL research. Most of the repair approaches described in the liter

Estilos ABNT, Harvard, Vancouver, APA, etc.

Borgwardt, Stefan, Walter Forkel, and Alisa Kovtunova. Finding New Diamonds: Temporal Minimal-World Query Answering over Sparse ABoxes. Technische Universität Dresden, 2019. http://dx.doi.org/10.25368/2023.223.

Texto completo da fonte

Resumo:

Lightweight temporal ontology languages have become a very active field of research in recent years. Many real-world applications, like processing electronic health records (EHRs), inherently contain a temporal dimension, and require efficient reasoning algorithms. Moreover, since medical data is not recorded on a regular basis, reasoners must deal with sparse data with potentially large temporal gaps. In this paper, we introduce a temporal extension of the tractable language ELH⊥, which features a new class of convex diamond operators that can be used to bridge temporal gaps. We develop a com

Estilos ABNT, Harvard, Vancouver, APA, etc.

Mashingia, Jane, S. Maboko, P. I. Mbwiri, et al. Joint Medicines Regulatory Procedure in the East African Community: Registration Timelines and Way Forward. Purdue University, 2021. http://dx.doi.org/10.5703/1288284317429.

Texto completo da fonte

Resumo:

A review of the East African Community (EAC) joint regulatory review process was conducted, registration timelines analyzed and key milestones, challenges and opportunities documented for the period of July 2015 to January 2020. A total of 113 applications were submitted for joint scientific review. Among these, 109 applications were assessed, 57 were recommended for marketing authorisation, 52 applications had queries to applicants and four applications were under review. A total median approval time for all products ranged from 53 to 102 days. The maximum time taken by a regulator to review

Estilos ABNT, Harvard, Vancouver, APA, etc.

Rosato-Scott, Claire, Dani J. Barrington, Amita Bhakta, Sarah J. House, Islay Mactaggart, and Jane Wilbur. Como falar sobre incontinência: Uma lista de controlo. The Sanitation Learning Hub, Institute of Development Studies, 2020. http://dx.doi.org/10.19088/slh.2020.009.

Texto completo da fonte

Resumo:

Incontinência é o termo médico usado para descrever as perdas involuntárias de urina ou de fezes. Mulheres, homens, raparigas, rapazes e pessoas de todos os sexos e em qualquer idade podem ter incontinência. Uma pessoa com incontinência pode ter perdas de urina ou de fezes esporádicas, regulares ou constantes; e essas perdas podem dar-se a qualquer hora, dia ou noite. Uma pessoa também pode ter perdas de matéria fecal ou urinária por não conseguir chegar a tempo à casa de banho ou por não querer usar as instalações sanitárias disponíveis. Chama-se a esse tipo de incontinência «incontinência so

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!