Gotowe bibliografie tematyczne / Query languages (Computer science)

Gotowa bibliografia na temat „Query languages (Computer science)”

Autor: Grafiati
Data publikacji: 4 czerwca 2021
Data aktualizacji: 28 lipca 2024

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Spis treści

Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Query languages (Computer science)”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Artykuły w czasopismach na temat "Query languages (Computer science)"

1

Kanellakis, P. C., G. M. Kuper i P. Z. Revesz. "Constraint Query Languages". Journal of Computer and System Sciences 51, nr 1 (sierpień 1995): 26–52. http://dx.doi.org/10.1006/jcss.1995.1051.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Dong, Guozhu, Leonid Libkin i Limsoon Wong. "Local properties of query languages". Theoretical Computer Science 239, nr 2 (maj 2000): 277–308. http://dx.doi.org/10.1016/s0304-3975(99)00223-6.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Chan, D. K. C. "Evaluating object-oriented query languages". Computer Journal 37, nr 10 (1.10.1994): 858–72. http://dx.doi.org/10.1093/comjnl/37.10.858.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Gyssens, Marc, Jan Van den Bussche i Dirk Van Gucht. "Complete Geometric Query Languages". Journal of Computer and System Sciences 58, nr 3 (czerwiec 1999): 483–511. http://dx.doi.org/10.1006/jcss.1999.1630.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Dahlhaus, E., i J. A. Makowsky. "Query languages for hierarchic databases". Information and Computation 101, nr 1 (listopad 1992): 1–32. http://dx.doi.org/10.1016/0890-5401(92)90074-p.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

V, Arjun Atreya, Ashish Kankaria, Pushpak Bhattacharyya i Ganesh Ramakrishnan. "Query Expansion in Resource-Scarce Languages". ACM Transactions on Asian and Low-Resource Language Information Processing 16, nr 2 (14.12.2016): 1–17. http://dx.doi.org/10.1145/2997643.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Ferri, Fernando, i Maurizio Rafanelli. "Resolution of Ambiguities in Query Interpretation for Geographical Pictorial Query Languages". Journal of Computing and Information Technology 12, nr 2 (2004): 119. http://dx.doi.org/10.2498/cit.2004.02.07.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Telemala, Joseph P., i Hussein Suleman. "Exploring Topic-language Preferences in Multilingual Swahili Information Retrieval in Tanzania". ACM Transactions on Asian and Low-Resource Language Information Processing 20, nr 6 (30.11.2021): 1–30. http://dx.doi.org/10.1145/3458671.

Pełny tekst źródła
Streszczenie:
Habitual switching of languages is a common behaviour among polyglots when searching for information on the Web. Studies in information retrieval (IR) and multilingual information retrieval (MLIR) suggest that part of the reason for such regular switching of languages is the topic of search. Unlike survey-based studies, this study uses query and click-through logs. It exploits the querying and results selection behaviour of Swahili MLIR system users to explore how topic of search (query) is associated with language preferences—topic-language preferences. This article is based on a carefully controlled study using Swahili-speaking Web users in Tanzania who interacted with a guided multilingual search engine. From the statistical analysis of queries and click-through logs, it was revealed that language preferences may be associated with the topics of search. The results also suggest that language preferences are not static; they vary along the course of Web search from query to results selection. In most of the topics, users either had significantly no language preference or preferred to query in Kiswahili and changed their preference to either English or no preference for language when selecting/clicking on the results. The findings of this study might provide researchers with more insights in developing better MLIR systems that support certain types of users and in certain scenarios.
Style APA, Harvard, Vancouver, ISO itp.
9

Zadorozhnyi, V. I., L. A. Kalinichenko i N. S. Nikitchenko. "Mutually complementary formalizations of deductive query languages". Cybernetics and Systems Analysis 29, nr 2 (1993): 229–41. http://dx.doi.org/10.1007/bf01132784.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Benedikt, Michael, i Leonid Libkin. "Aggregate Operators in Constraint Query Languages". Journal of Computer and System Sciences 64, nr 3 (maj 2002): 628–54. http://dx.doi.org/10.1006/jcss.2001.1810.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł

Rozprawy doktorskie na temat "Query languages (Computer science)"

1

Robinson, Aaron R. "Integrating a universal query mechanism into Java /". Online version of thesis, 2007. http://hdl.handle.net/1850/4816.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Crous, Theodorus. "Semantos : a semantically smart information query language". Pretoria : [s.n.], 2008. http://upetd.up.ac.za/thesis/available/etd-11292009-190944/.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Wisnesky, Ryan. "Functional Query Languages with Categorical Types". Thesis, Harvard University, 2013. http://dissertations.umi.com/gsas.harvard:11288.

Pełny tekst źródła
Streszczenie:
We study three category-theoretic types in the context of functional query languages (typed lambda-calculi extended with additional operations for bulk data processing). The types we study are:
Engineering and Applied Sciences
Style APA, Harvard, Vancouver, ISO itp.
4

Jiang, Haifeng. "Efficient structural query processing in XML databases /". View abstract or full-text, 2004. http://library.ust.hk/cgi/db/thesis.pl?COMP%202004%20JIANG.

Pełny tekst źródła
Streszczenie:
Thesis (Ph. D.)--Hong Kong University of Science and Technology, 2004.
Includes bibliographical references (leaves 115-125). Also available in electronic version. Access restricted to campus users.
Style APA, Harvard, Vancouver, ISO itp.
5

Faisal, Farhan. "Query-by-Pointing: Algorithms and Pointing Error Compensation". Fogler Library, University of Maine, 2003. http://www.library.umaine.edu/theses/pdf/FaisalF2003.pdf.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Mouratidis, Kyriakos. "Continuous monitoring of multi-dimensional queries /". View abstract or full-text, 2006. http://library.ust.hk/cgi/db/thesis.pl?COMP%202006%20MOURAT.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Li, Xiang, i 李想. "Managing query quality in probabilistic databases". Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2011. http://hub.hku.hk/bib/B47753134.

Pełny tekst źródła
Streszczenie:
In many emerging applications, such as sensor networks, location-based services, and data integration, the database is inherently uncertain. To handle a large amount of uncertain data, probabilistic databases have been recently proposed, where probabilistic queries are enabled to provide answers with statistical guarantees. In this thesis, we study the important issues of managing the quality of a probabilistic database. We first address the problem of measuring the ambiguity, or quality, of a probabilistic query. This is accomplished by computing the PWS-quality score, a recently proposed measure for quantifying the ambiguity of query answers under the possible world semantics. We study the computation of the PWS-quality for the top-k query. This problem is not trivial, since directly computing the top-k query score is computationally expensive. To tackle this challenge, we propose efficient approximate algorithms for deriving the quality score of a top-k query. We have performed experiments on both synthetic and real data to validate their performance and accuracy. Our second contribution is to study how to use the PWS-quality score to coordinate the process of cleaning uncertain data. Removing ambiguous data from a probabilistic database can often give us a higher-quality query result. However, this operation requires some external knowledge (e.g., an updated value from a sensor source), and is thus not without cost. It is important to choose the correct object to clean, in order to (1) achieve a high quality gain, and (2) incur a low cleaning cost. In this thesis, we examine different cleaning methods for a probabilistic top-k query. We also study an interesting problem where different query users have their own budgets available for cleaning. We demonstrate how an optimal solution, in terms of the lowest cleaning costs, can be achieved, for probabilistic range and maximum queries. An extensive evaluation reveals that these solutions are highly efficient and accurate.
published_or_final_version
Computer Science
Master
Master of Philosophy
Style APA, Harvard, Vancouver, ISO itp.
8

Evangelista, Mark A. "Implementation of data flow query language on a handheld device". Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2005. http://library.nps.navy.mil/uhtbin/hyperion/05Mar%5FEvangelista.pdf.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Elsidani, Elariss Haifa. "A new visual query language and query optimization for mobile GPS". Thesis, Kingston University, 2008. http://eprints.kingston.ac.uk/20306/.

Pełny tekst źródła
Streszczenie:
In recent years computer applications have been deployed to manage spatial data with Geographic Information Systems (GIS) to store and analyze data related to domains such as transportation and tourism. Recent developments have shown that there is an urgent need to develop systmes for mobile devices and particularly for Location Based Services (LBS) such as proximity analysis that helps in finding the nearest neighbors, for example. restaurant, and the facilities that are located within a circle area around the user's location, known as a buffer area, for example, all restaurants within 100 meters. The mobile market potential is across geographical and cultural boundaries. Hence the visualization of queries becomes important especially that the existing visual query languages have a number of limitations. They are not tailored for mobile GIS and they do not support dynamic complex queries (DCQ) and visual query formation. Thus, the first aim of this research is to develop a new visual query language (IVQL) for mobile GIS that handles static and DCQ for proximity analysis. IVQL is designed and implemented using smiley icons that visualize operators, values, and objects. The evaluation results reveal that it has an expressive power, easy-to-use user interface, easy query building, and a high user satisfaction. There is also a need that new optimization strategies consider the scale of mobile user queries. Existing query optimization strategies are based on the sharing and push-down paradigms and they do not cover multiple-DCQ (MDCQ) for proximity analysis. This leads to the second aim of this thesis which is to develop the query melting processor (QMP) that is responsible for processing MDCQs. QMP is based on the new Query Melting paradigm which consists of the sharing paradigm, query optimization, and is implemented by a new strategy "Melting Ruler". Moreover, with the increase in volume of cost sensitive mobile users, the need emerges to develop a time cost optimizer for processing MDCQs. Thus, the thirs aim of the thesis is to develop a new Decision Making Mechanism for time cost optimization (TCOP) and prove its cost effectiveness. TCOP is based on the new paradigm "Sharing global execution plans by MDCQs with similar scenarios". The experimental evaluation results, using a case study based on the map of Paris, proved that significant saving in time can be achieved by employing the newly developed strategies.
Style APA, Harvard, Vancouver, ISO itp.
10

Dai, Xiangyuan. "Spatial queries based on non-spatial constraints". Click to view the E-thesis via HKUTO, 2006. http://sunzi.lib.hku.hk/hkuto/record/B38436395.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł

Książki na temat "Query languages (Computer science)"

1

Faulstich, Lukas C. Implementing linguistic query languages using LoToS. Berlin: Humblot-Universität zu Berlin, 2005.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Snodgrass, Richard T. The TSQL2 temporal query language. New York: Springer, 1995.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Chaudhuri, Surajit. Detecting redundant tuples during query evaluation. Stanford, Calif: Dept. of Computer Science, Stanford University, 1992.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Ma, Zongmin, i Li Yan. Advanced database query systems: Techniques, applications and technologies. Redaktor IGI Global. Hershey, Pa: IGI Global (701 E. Chocolate Avenue, Hershey, Pennsylvania, 17033, USA), 2011.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Gu, Jun. A unified architecture for web-based interfaces to scientific databases. Corvallis, OR: Oregon State University, Dept. of Computer Science, 2000.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Curé, Olivier. RDF database systems: Triples storage and SPARQL query processing. Amsterdam: Morgan Kaufmann, 2015.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

J, Larkins Michael, red. Netezza SQL. [S.l.]: Coffing Pub., 2014.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Nevarez, Benjamin. Inside the SQL server query optimizer. [S.l.]: Red Gate Books, 2011.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Rattz, Joseph C. Pro LINQ: Language Integrated Query in VB 2008. Berkeley, CA: Apress, 2009.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Schreier, Howard. PROC SQL by example: Using SQL within SAS. Cary, N.C: SAS Institute, 2008.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł

Części książek na temat "Query languages (Computer science)"

1

Asher Hasson, R., i Johann A. Makowsky. "Update Languages vs. Query Languages". W Computer Science, 23–33. Boston, MA: Springer US, 1992. http://dx.doi.org/10.1007/978-1-4615-3422-8_4.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Revesz, Peter. "Safe Query Languages". W Texts in Computer Science, 555–70. London: Springer London, 2009. http://dx.doi.org/10.1007/978-1-84996-095-3_22.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Dong, Guozhu, Leonid Libkin i Limsoon Wong. "Local properties of query languages". W Lecture Notes in Computer Science, 140–54. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-62222-5_42.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Weik, Martin H. "query language". W Computer Science and Communications Dictionary, 1390. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_15265.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Alechina, Natasha, Tristan Behrens, Koen V. Hindriks i Brian Logan. "Query Caching in Agent Programming Languages". W Lecture Notes in Computer Science, 123–37. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-38700-5_8.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Stewart, Robert J., Phil W. Trinder i Hans-Wolfgang Loidl. "Comparing High Level MapReduce Query Languages". W Lecture Notes in Computer Science, 58–72. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-24151-2_5.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Kanellakis, Paris C., i Dina Q. Goldin. "Constraint programming and database query languages". W Lecture Notes in Computer Science, 96–120. Berlin, Heidelberg: Springer Berlin Heidelberg, 1994. http://dx.doi.org/10.1007/3-540-57887-0_92.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Vassilakis, Costas, Panagiotis Georgiadis i Timos Sellis. "Implementing embedded valid time query languages". W Lecture Notes in Computer Science, 561–72. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/bfb0054514.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Bidoit, Nicole, i Sandra de Amo. "Implicit Temporal Query Languages: Towards Completeness". W Lecture Notes in Computer Science, 245–57. Berlin, Heidelberg: Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-46691-6_19.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Weik, Martin H. "Structured Query Language". W Computer Science and Communications Dictionary, 1679. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_18426.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.

Streszczenia konferencji na temat "Query languages (Computer science)"

1

Brichau, Johan, Coen De Roover i Kim Mens. "Open Unification for Program Query Languages". W SCCC 2007 - 26th International Conference of the Chilean Computer Science Society. IEEE, 2007. http://dx.doi.org/10.1109/sccc.2007.16.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Ehlers, Jens. "Teaching Multiple Data Models and Query Languages". W ITiCSE 2024: Innovation and Technology in Computer Science Education. New York, NY, USA: ACM, 2024. http://dx.doi.org/10.1145/3649217.3653628.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Brichau, Johan, Coen De Roover i Kim Mens. "Open Unification for Program Query Languages". W XXVI International Conference of the Chilean Society of Computer Science (SCCC'07). IEEE, 2007. http://dx.doi.org/10.1109/sccc.2007.4396981.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Van den Bussche, J., D. Van Gucht, M. Andries i M. Gyssens. "On the completeness of object-creating query languages". W Proceedings., 33rd Annual Symposium on Foundations of Computer Science. IEEE, 1992. http://dx.doi.org/10.1109/sfcs.1992.267753.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Aaronson, Scott, Daniel Grier i Luke Schaeffer. "A Quantum Query Complexity Trichotomy for Regular Languages". W 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 2019. http://dx.doi.org/10.1109/focs.2019.00061.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Chen, Ji-Dong, i Ping-Yang Li. "A Chinese natural language query system giving information about computer science". W the 1988 ACM sixteenth annual conference. New York, New York, USA: ACM Press, 1988. http://dx.doi.org/10.1145/322609.323196.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Calì, Andrea, Georg Gottlob, Thomas Lukasiewicz, Bruno Marnette i Andreas Pieris. "Datalog+/-: A Family of Logical Knowledge Representation and Query Languages for New Applications". W 2010 25th Annual IEEE Symposium on Logic in Computer Science (LICS 2010). IEEE, 2010. http://dx.doi.org/10.1109/lics.2010.27.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Shoaib, Muhammad, i Amna Basharat. "4th Generation Flexible Query Language for Ontology Querying". W 2011 IEEE/ACIS 10th International Conference on Computer and Information Science (ICIS). IEEE, 2011. http://dx.doi.org/10.1109/icis.2011.60.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Zhaojun, Wu. "Research on language expression query method based on XML". W EBIMCS: 2022 5th International Conference on E-Business, Information Management and Computer Science. New York, NY, USA: ACM, 2022. http://dx.doi.org/10.1145/3584748.3584773.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Cheng, Li, i Alei Liang. "REL: A structural query language for processing massive line-based records". W 2013 3rd International Conference on Computer Science and Network Technology (ICCSNT). IEEE, 2013. http://dx.doi.org/10.1109/iccsnt.2013.6967089.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.

Raporty organizacyjne na temat "Query languages (Computer science)"

1

Baader, Franz, i Alexander Okhotin. On Language Equations with One-sided Concatenation. Aachen University of Technology, 2006. http://dx.doi.org/10.25368/2022.154.

Pełny tekst źródła
Streszczenie:
Language equations are equations where both the constants occurring in the equations and the solutions are formal languages. They have first been introduced in formal language theory, but are now also considered in other areas of computer science. In the present paper, we restrict the attention to language equations with one-sided concatenation, but in contrast to previous work on these equations, we allow not just union but all Boolean operations to be used when formulating them. In addition, we are not just interested in deciding solvability of such equations, but also in deciding other properties of the set of solutions, like its cardinality (finite, infinite, uncountable) and whether it contains least/greatest solutions. We show that all these decision problems are ExpTime-complete.
Style APA, Harvard, Vancouver, ISO itp.
Możesz być także zainteresowany rozszerzonymi bibliografiami na temat „Query languages (Computer science)” dla poszczególnych typów źródeł:
Artykuły w czasopismach Rozprawy doktorskie Książki
Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!

Do bibliografii