Готові списки джерел за темами / Query languages (Computer science)

Добірка наукової літератури з теми "Query languages (Computer science)"

Автор: Grafiati
Опубліковано: 4 червня 2021
Оновлено: 28 липня 2024

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

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

Зміст

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Query languages (Computer science)".

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

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

Статті в журналах з теми "Query languages (Computer science)"

1

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

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

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

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

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

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

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

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

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

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

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

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

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

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

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

Повний текст джерела
Анотація:
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.
Стилі APA, Harvard, Vancouver, ISO та ін.
9

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

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

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

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Більше джерел

Дисертації з теми "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.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

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

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

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

Повний текст джерела
Анотація:
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
Стилі APA, Harvard, Vancouver, ISO та ін.
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.

Повний текст джерела
Анотація:
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.
Стилі APA, Harvard, Vancouver, ISO та ін.
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.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
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.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

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

Повний текст джерела
Анотація:
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
Стилі APA, Harvard, Vancouver, ISO та ін.
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.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
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/.

Повний текст джерела
Анотація:
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.
Стилі APA, Harvard, Vancouver, ISO та ін.
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.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Більше джерел

Книги з теми "Query languages (Computer science)"

1

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

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

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

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

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

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

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

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

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

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

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

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

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

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

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

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

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

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

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

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Більше джерел

Частини книг з теми "Query languages (Computer science)"

1

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

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

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

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

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

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

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

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Alechina, Natasha, Tristan Behrens, Koen V. Hindriks, and Brian Logan. "Query Caching in Agent Programming Languages." In 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.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Stewart, Robert J., Phil W. Trinder, and Hans-Wolfgang Loidl. "Comparing High Level MapReduce Query Languages." In 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.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

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

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

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

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

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

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

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

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.

Тези доповідей конференцій з теми "Query languages (Computer science)"

1

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

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

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

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

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

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

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

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

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

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

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

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

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

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

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

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Zhaojun, Wu. "Research on language expression query method based on XML." In 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.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

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

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.

Звіти організацій з теми "Query languages (Computer science)"

1

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

Повний текст джерела
Анотація:
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.
Стилі APA, Harvard, Vancouver, ISO та ін.
Також вас можуть зацікавити розширені добірки на тему "Query languages (Computer science)" для конкретних типів джерел:
Статті в журналах Дисертації Книги
Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!

До бібліографії