Gotowe bibliografie tematyczne / Querying (Computer science)

Gotowa bibliografia na temat „Querying (Computer science)”

Autor: Grafiati
Data publikacji: 4 czerwca 2021
Data aktualizacji: 20 lutego 2023

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 „Querying (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 "Querying (Computer science)"

1

Lai, Catherine, i Steven Bird. "Querying Linguistic Trees". Journal of Logic, Language and Information 19, nr 1 (28.05.2009): 53–73. http://dx.doi.org/10.1007/s10849-009-9086-9.

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

Vardi, Moshe Y. "Querying logical databases". Journal of Computer and System Sciences 33, nr 2 (październik 1986): 142–60. http://dx.doi.org/10.1016/0022-0000(86)90016-4.

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

Ganesan, K., i G. Siva. "Multilingual Querying and Information Processing". Information Technology Journal 6, nr 5 (15.06.2007): 751–55. http://dx.doi.org/10.3923/itj.2007.751.755.

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

Buneman, O. P., S. B. Davidson i A. Watters. "Querying independent databases". Information Sciences 52, nr 1 (październik 1990): 1–34. http://dx.doi.org/10.1016/0020-0255(90)90033-7.

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

Barton, Carl, Mathieu Giraud, Costas S. Iliopoulos, Thierry Lecroq, Laurent Mouchard i Solon P. Pissis. "Querying highly similar sequences". International Journal of Computational Biology and Drug Design 6, nr 1/2 (2013): 119. http://dx.doi.org/10.1504/ijcbdd.2013.052206.

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

Chabrier-Rivier, Nathalie, Marc Chiaverini, Vincent Danos, François Fages i Vincent Schächter. "Modeling and querying biomolecular interaction networks". Theoretical Computer Science 325, nr 1 (wrzesień 2004): 25–44. http://dx.doi.org/10.1016/j.tcs.2004.03.063.

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

Siddiqui, Tarique, Paul Luh, Zesheng Wang, Karrie Karahalios i Aditya G. Parameswaran. "Expressive querying for accelerating visual analytics". Communications of the ACM 65, nr 7 (lipiec 2022): 85–94. http://dx.doi.org/10.1145/3535337.

Pełny tekst źródła
Streszczenie:
Data visualization is the primary means by which data analysts explore patterns, trends, and insights in their data. Unfortunately, existing visual analytics tools offer limited expressiveness and scalability when it comes to searching for visualizations over large datasets, making visual data exploration labor-intensive and time-consuming. In this work, we introduce the problem of visualization search and highlight two underlying challenges of search enumeration and visualization matching. To address them, we first present our work on Zenvisage that helps enumerate large collections of visualizations and supports simple visualization matching with the help of an interactive interface and an expressive visualization query language. For more finegrained and flexible visualization matching, including search for underspecified and approximate patterns, we extend Zenvisage to develop ShapeSearch. ShapeSearch supports a novel shape querying algebra that helps express a large class of pattern queries that are hard to specify with existing systems. ShapeSearch exposes multiple specification mechanisms: sketch, natural-language, and visual regular expressions that help users easily issue shape queries, while applying query-aware and perceptually-aware optimizations to efficiently execute them within interactive response times. To conclude, we discuss a number of open research problems to further improve the usability and performance of both Zenvisage and ShapeSearch.
Style APA, Harvard, Vancouver, ISO itp.
8

Cao, Zhongsheng, Zongda Wu, Yuanzhen Wang i Guiling Li. "Processing Techniques for Querying Multimedia Contents". Information Technology Journal 8, nr 8 (1.11.2009): 1115–28. http://dx.doi.org/10.3923/itj.2009.1115.1128.

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

Flesca, S., F. Furfaro i S. Greco. "Graph Grammars for Querying Graph-like Data". Electronic Notes in Theoretical Computer Science 50, nr 3 (sierpień 2001): 247–56. http://dx.doi.org/10.1016/s1571-0661(04)00176-8.

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

Belazzougui, Djamal, Roman Kolpakov i Mathieu Raffinot. "Indexing and querying color sets of images". Theoretical Computer Science 647 (wrzesień 2016): 74–84. http://dx.doi.org/10.1016/j.tcs.2016.07.041.

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

Rozprawy doktorskie na temat "Querying (Computer science)"

1

Yang, Lei. "Querying Graph Structured Data". Case Western Reserve University School of Graduate Studies / OhioLINK, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=case1410434109.

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

Chavda, Manoj. "Visually querying object-oriented databases". Master's thesis, University of Cape Town, 1997. http://hdl.handle.net/11427/17516.

Pełny tekst źródła
Streszczenie:
Bibliography: pages 141-145.
As database requirements increase, the ability to construct database queries efficiently becomes more important. The traditional means of querying a database is to write a textual query, such as writing in SQL to query a relational database. Visual query languages are an alternative means of querying a database; a visual query language can embody powerful query abstraction and user feedback techniques, thereby making them potentially easier to use. In this thesis, we develop a visual query system for ODMG-compliant object-oriented databases, called QUIVER. QUIVER has a comprehensive expressive power; apart from supporting data types such as sets, bags, arrays, lists, tuples, objects and relationships, it supports aggregate functions, methods and sub-queries. The language is also consistent, as constructs with similar functionality have similar visual representations. QUIVER uses the DOT layout engine to automatically layout a query; QUIVER queries are easily constructed, as the system does not constrain the spatial arrangement of query items. QUIVER also supports a query library, allowing queries to be saved, retrieved and shared among users. A substantial part of the design has been implemented using the ODMG-compliant database system O₂, and the usability of the interface as well as the query language itself is presented. Visual queries are translated to OQL, the standard query language proposed by the ODMG, and query answers are presented using O₂ Look. During the course of our investigation, we conducted a user evaluation to compare QUIVER and OQL. The results were extremely encouraging in favour of QUIVER.
Style APA, Harvard, Vancouver, ISO itp.
3

Wu, Chao-Hui. "Querying and synchronizing multimedia presentations /". The Ohio State University, 1998. http://rave.ohiolink.edu/etdc/view?acc_num=osu1488186329501598.

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

Hossain, Md Delwar. "Querying communities of interest in peer database networks". Thesis, University of Ottawa (Canada), 2005. http://hdl.handle.net/10393/26926.

Pełny tekst źródła
Streszczenie:
Peer-to-Peer (P2P) networks are used primarily for file sharing. P2P user communities are continuing to grow rapidly, but there is no specific query mechanism for communities of interest in peer database networks. Peer databases are linked to each other through acquaintances. These are individual, independently developed databases that contain local data. Many researchers have tackled the problem of query processing in P2P networks. Moreover, researchers have started to investigate community-based querying in peer database networks. The focus of this thesis is to study a query translation mechanism, to develop an algorithm for querying communities of interest in peer database networks, and to implement a prototype of this algorithm. P2P communities are formed using common claimed items. First, we investigate an existing community formation and discovery algorithm for a text file, as well as an existing query translation mechanism for peer databases. After that, we develop a community-based search algorithm for peer databases. The developed algorithm combines the aforementioned community formation and discovery with the query translation mechanisms. A prototype has been developed and experimental results are shown. An approach for discovering communities 'on the fly' is introduced and a method for optimizing the community discovery technique is shown.
Style APA, Harvard, Vancouver, ISO itp.
5

Chiu, Tsz Wai. "WinyDB : collaboratively querying sensor networks through handheld devices /". View abstract or full-text, 2008. http://library.ust.hk/cgi/db/thesis.pl?CSED%202008%20CHIUT.

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

Colgrove, Matthew Edward. "Querying Geographically Dispersed, Heterogeneous Data Stores: The PPerfXchange Approach". PDXScholar, 2002. https://pdxscholar.library.pdx.edu/open_access_etds/2665.

Pełny tekst źródła
Streszczenie:
This thesis details PPerfXchange’s approach for querying geographically dispersed heterogeneous data stores. While elements of PPerfXchange’s method have been implemented for other application areas, PPerfXchange shows how these elements can be applied to parallel performance analysis. The accomplishments of this thesis are: The design of an architecture for PPerfXchange, giving a uniform method to query heterogeneous data stores; A proof of concept prototype implementation of PPerfXchange including a partial implementation of an XQuery processor and a relational database virtual XML document; and Evaluation of PPerfXchange using example parallel performance analysis data.
Style APA, Harvard, Vancouver, ISO itp.
7

Qiao, Shi. "QUERYING GRAPH STRUCTURED RDF DATA". Case Western Reserve University School of Graduate Studies / OhioLINK, 2016. http://rave.ohiolink.edu/etdc/view?acc_num=case1447198654.

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

Sun, Yi. "Querying with Ontological Terminologies And their Annotations". Miami University / OhioLINK, 2007. http://rave.ohiolink.edu/etdc/view?acc_num=miami1177653662.

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

Lam, Wai-Yeung. "XCQ : a framework for XML compression and querying /". View abstract or full-text, 2003. http://library.ust.hk/cgi/db/thesis.pl?COMP%202003%20LAM.

Pełny tekst źródła
Streszczenie:
Thesis (M.Phil.)--Hong Kong University of Science and Technology, 2003.
Includes bibliographical references (leaves 142-147). Also available in electronic version. Access restricted to campus users.
Style APA, Harvard, Vancouver, ISO itp.
10

Li, Jing, i 李晶. "Advanced spatial queries with textual and social components". Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2012. http://hub.hku.hk/bib/B49617837.

Pełny tekst źródła
Streszczenie:
The emerging new services for GPS and mobile users have developed applications that access and exploit spatial objects with new components (e.g. text and social network). Web objects, including blogs, tweets, photos and videos, are embedded into a map by the APIs of map service providers, where textual messages are associated with geographic information. Location-based social networking services, arising from Facebook and Foursquare, allow users to browse and share their traces of locations among the social networks. Among this class of applications, the highlight is that the retrieved spatial objects (e.g. points of interest and moving users) are featured with new components. Integrating such new components into the spatial query processing has produced large amounts of promising results. However, handling new components along with the retrieval of spatial objects increases the complexity of such joint query processing significantly. Thus, management over data from such multiple domains has been received considerable attention from database research community. In this thesis, we introduce three interesting problems and study their sophisticated solutions for processing spatial objects with new components: (i) category-aware optimal route query (CORQ), (ii) social and spatial ranking query (SSRQ), and (iii) efficient notification of meeting point (ENMP) query. Our results for (i) and (ii) facilitate the retrieval of spatial objects from multiple domains while our solutions for (iii) provide effective tools for synchronous management of multiple moving users from a social network. Category-aware optimal route queries (CORQ) are generalized from the traveling salesman problem and enable users to retrieve shortest routes covering selected categories. Social and spatial ranking queries (SSRQ) are relevant to spatial object recommendations using social information and allow users to obtain the spatial objects that not only are near their locations but also impress them with high social influence. Efficient notification of meeting point (ENMP) queries are variants of aggregate nearest neighbor queries and provide real-time rearrangement for multiple moving users according to their locations. Query processing in such multiple domains is complicated due to the mixture of domain information and their integration within one search. Naïve algorithms for these problems incur either numerous expensive evaluations or massive communication cost, which render them inapplicable to large datasets. Our main research purpose is to design efficient and effective solutions for the proposed problems, that avoid the aforementioned shortcomings of naïve algorithms.
published_or_final_version
Computer Science
Doctoral
Doctor of Philosophy
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł

Książki na temat "Querying (Computer science)"

1

Salander, Elisabeth C., i Elisabeth C. Salander. Computer search algorithms. Hauppauge, N.Y: Nova Science Publishers, 2010.

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

Salander, Elisabeth C. Computer search algorithms. Hauppauge, N.Y: Nova Science Publishers, 2010.

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

Bell, Richard, writer of additional text, Dunlop, Davetta writer of additional text i SAS Institute, red. SAS enterprise guide 1: Querying and reporting. Cary, N.C: SAS Institute, 2012.

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

DuCharme, Bob. Learning SPARQL: Querying and updating with SPARQL 1.1. Sebastopol, CA: O'Reilly Media, 2011.

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

Clifford, James. Formal semantics and pragmatics for natural language querying. Cambridge: Cambridge University Press, 1990.

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

Clifford, James. Formal Semantics and Pragmatics for Natural Language Querying. Cambridge: Cambridge University Press, 1990.

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

Yan, Li. Handbook of research on innovative database query processing techniques. Hershey, PA: Information Science Reference, 2016.

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

Bestehorn, Markus. Querying Moving Objects Detected by Sensor Networks. New York, NY: Springer New York, 2013.

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

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.
10

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.
Więcej źródeł

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

1

Denney, Ewen, Dwight Naylor i Ganesh Pai. "Querying Safety Cases". W Lecture Notes in Computer Science, 294–309. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-10506-2_20.

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

Arfaoui, Olfa, i Minyar Sassi-Hidri. "Querying Compressed XML Data". W Lecture Notes in Computer Science, 487–98. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-40319-4_42.

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

Abiteboul, Serge. "Querying semi-structured data". W Lecture Notes in Computer Science, 1–18. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/3-540-62222-5_33.

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

Rho, Hongsik, Wen-Chi Hou, Dunren Che i Chih-Fang Wang. "Querying Semistructured Data Efficiently". W Lecture Notes in Computer Science, 18–27. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-540-45227-0_3.

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

Pivert, Olivier, i Henri Prade. "Querying Uncertain Multiple Sources". W Lecture Notes in Computer Science, 286–91. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-11508-5_24.

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

Ahmed, Waqas, i Esteban Zimányi. "Querying Multiversion Data Warehouses". W Communications in Computer and Information Science, 346–57. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-23201-0_36.

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

Thirunarayan, Krishnaprasad, i Trivikram Immaneni. "Flexible Querying of XML Documents". W Lecture Notes in Computer Science, 198–207. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11875604_23.

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

Cheng, Reynold. "Querying and Cleaning Uncertain Data". W Lecture Notes in Computer Science, 41–52. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-04559-2_4.

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

Rosati, Riccardo. "The Limits of Querying Ontologies". W Lecture Notes in Computer Science, 164–78. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11965893_12.

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

Dumbrava, Stefania, Angela Bonifati, Amaia Nazabal Ruiz Diaz i Romain Vuillemot. "Approximate Querying on Property Graphs". W Lecture Notes in Computer Science, 250–65. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-35514-2_19.

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

Streszczenia konferencji na temat "Querying (Computer science)"

1

Bárány, Vince, Georg Gottlob i Martin Otto. "Querying the Guarded Fragment". W 2010 25th Annual IEEE Symposium on Logic in Computer Science (LICS 2010). IEEE, 2010. http://dx.doi.org/10.1109/lics.2010.26.

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

Zechinelli-Martini, Jose-Luis, i Ilian Elias-Morales. "Modelling and querying sensor databases". W Eighth Mexican International Conference on Current Trends in Computer Science (ENC 2007). IEEE, 2007. http://dx.doi.org/10.1109/enc.2007.29.

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

Zechinelli-Martini, Jose-Luis, i Ilian Elias-Morales. "Modelling and querying sensor databases". W Eighth Mexican International Conference on Current Trends in Computer Science (ENC 2007). IEEE, 2007. http://dx.doi.org/10.1109/enc.2007.4351436.

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

Benedikt, Michael, Pierre Bourhis, Balder ten Cate i Gabriele Puppis. "Querying Visible and Invisible Information". W LICS '16: 31st Annual ACM/IEEE Symposium on Logic in Computer Science. New York, NY, USA: ACM, 2016. http://dx.doi.org/10.1145/2933575.2935306.

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

Guerroudji-Meddah, Fatiha, Hafida Belbachir i Robert Laurini. "A visual language for GIS querying". W 2009 2nd IEEE International Conference on Computer Science and Information Technology. IEEE, 2009. http://dx.doi.org/10.1109/iccsit.2009.5234515.

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

Wang, Jinpeng, Zhuang Miao, Yafei Zhang i Bo Zhou. "Querying Heterogeneous Relational Database using SPARQL". W 2009 Eighth IEEE/ACIS International Conference on Computer and Information Science. IEEE, 2009. http://dx.doi.org/10.1109/icis.2009.11.

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

Cuevas-Vicenttín, Víctor, Genoveva Vargas-Solar, Christine Collet i Paolo Bucciol. "Efficiently Coordinating Services for Querying Data in Dynamic Environments". W 2009 Mexican International Conference on Computer Science. IEEE, 2009. http://dx.doi.org/10.1109/enc.2009.34.

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

Barcelo, Pablo, Cristina Feier, Carsten Lutz i Andreas Pieris. "When is Ontology-Mediated Querying Efficient?" W 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). IEEE, 2019. http://dx.doi.org/10.1109/lics.2019.8785823.

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

Okure, Akanimo Samuel, i Jeff Z. Pan. "Querying EL Ontology Stream with C-SPARQL". W 2013 International Conference on Advanced Computer Science Applications and Technologies (ACSAT). IEEE, 2013. http://dx.doi.org/10.1109/acsat.2013.73.

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

Zhu, Qing. "Integrating Strategies for Keyword Querying across Heterogeneous Databases". W 2009 First International Workshop on Education Technology and Computer Science. IEEE, 2009. http://dx.doi.org/10.1109/etcs.2009.643.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Możesz być także zainteresowany rozszerzonymi bibliografiami na temat „Querying (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