Gotowe bibliografie tematyczne / Querying (Computer science) / Artykuły w czasopismach

Artykuły w czasopismach na temat „Querying (Computer science)”

Kliknij ten link, aby zobaczyć inne rodzaje publikacji na ten 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:

Sprawdź 50 najlepszych artykułów w czasopismach 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.

Przeglądaj artykuły w czasopismach z różnych dziedzin i twórz odpowiednie bibliografie.

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

COSTAGLIOLA, GENNARO, i ERLAND JUNGERT. "Towards Querying Multiple Data Sources". Journal of Visual Languages & Computing 12, nr 1 (luty 2001): 1–2. http://dx.doi.org/10.1006/jvlc.2000.0196.

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

Grzegorzewski, Przemysław, i Edyta Mrówka. "Flexible querying via if-sets". International Journal of Intelligent Systems 22, nr 6 (2007): 587–97. http://dx.doi.org/10.1002/int.20215.

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

Knappe, Rasmus, Henrik Bulskov i Troels Andreasen. "Perspectives on ontology-based querying". International Journal of Intelligent Systems 22, nr 7 (2007): 739–61. http://dx.doi.org/10.1002/int.20226.

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

Liu, H., P. Van Oosterom, M. Meijers i E. Verbree. "AN OPTIMIZED SFC APPROACH FOR ND WINDOW QUERYING ON POINT CLOUDS". ISPRS Annals of Photogrammetry, Remote Sensing and Spatial Information Sciences VI-4/W1-2020 (3.09.2020): 119–28. http://dx.doi.org/10.5194/isprs-annals-vi-4-w1-2020-119-2020.

Pełny tekst źródła
Streszczenie:
Abstract. Dramatically increasing collection of point clouds raises an essential demand for highly efficient data management. It can also facilitate modern applications such as robotics and virtual reality. Extensive studies have been performed on point data management and querying, but most of them concentrate on low dimensional spaces. High dimensional data management solutions from computer science have not considered the special features of spatial data; so, they may not be optimal. A Space Filling Curve (SFC) based approach, PlainSFC which is capable of nD point querying has been proposed and tested in low dimensional spaces. However, its efficiency in nD space is still unknown. Besides that, PlainSFC performs poorly on skewed data querying. This paper develops HistSFC which utilizes point distribution information to improve the querying efficiency on skewed data. Then, the paper presents statistical analysis of how PlainSFC and HistSFC perform when dimensionality increases. By experimenting on simulated nD data and real data, we confirmed the patterns deduced: for inhomogeneous data querying, the false positive rate (FPR) of PlainSFC increases drastically as dimensionality goes up. HistSFC alleviates such deterioration to a large extent. Despite performance degeneration in ultra high dimensional spaces, HistSFC can be applied with high efficiency for most spatial applications. The generic theoretical framework developed also allows us to study related topics such as visualization and data transmission in the future.
Style APA, Harvard, Vancouver, ISO itp.
15

Gehani, Ashish, Raza Ahmad, Hassaan Irshad, Jianqiao Zhu i Jignesh Patel. "Digging into big provenance (with SPADE)". Communications of the ACM 64, nr 12 (grudzień 2021): 48–56. http://dx.doi.org/10.1145/3475358.

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

Nasir, J. A., M. K. Shahzad . i M. A. Pasha . "Transparent Querying Multiple-versions of Data Warehouse". Information Technology Journal 5, nr 2 (15.02.2006): 250–59. http://dx.doi.org/10.3923/itj.2006.250.259.

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

Xin, Guanlin, i Jinglei Liu. "Exact Dominance Querying Algorithm on CP-nets". International Journal of Database Theory and Application 9, nr 5 (31.05.2016): 21–36. http://dx.doi.org/10.14257/ijdta.2016.9.5.03.

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

Chen, Bo, Huaijie Zhu, Wei Liu, Jian Yin, Wang-Chien Lee i Jianliang Xu. "Querying Optimal Routes for Group Meetup". Data Science and Engineering 6, nr 2 (15.03.2021): 180–91. http://dx.doi.org/10.1007/s41019-021-00153-5.

Pełny tekst źródła
Streszczenie:
AbstractMotivated by location-based social networks which allow people to access location-based services as a group, we study a novel variant of optimal sequenced route (OSR) queries, optimal sequenced route for group meetup (OSR-G) queries. OSR-G query aims to find the optimal meeting POI (point of interest) such that the maximum users’ route distance to the meeting POI is minimized after each user visits a number of POIs of specific categories (e.g., gas stations, restaurants, and shopping malls) in a particular order. To process OSR-G queries, we first propose an OSR-Based (OSRB) algorithm as our baseline, which examines every POI in the meeting category and utilizes existing OSR (called E-OSR) algorithm to compute the optimal route for each user to the meeting POI. To address the shortcomings (i.e., requiring to examine every POI in the meeting category) of OSRB, we propose an upper bound based filtering algorithm, called circle filtering (CF) algorithm, which exploits the circle property to filter the unpromising meeting POIs. In addition, we propose a lower bound based pruning (LBP) algorithm, namely LBP-SP which exploits a shortest path lower bound to prune the unqualified meeting POIs to reduce the search space. Furthermore, we develop an approximate algorithm, namely APS, to accelerate OSR-G queries with a good approximation ratio. Finally the experimental results show that both CF and LBP-SP outperform the OSRB algorithm and have high pruning rates. Moreover, the proposed approximate algorithm runs faster than the exact OSR-G algorithms and has a good approximation ratio.
Style APA, Harvard, Vancouver, ISO itp.
19

Gehani, Ashish, Raza Ahmad, Hassan Irshad, Jianqiao Zhu i Jignesh Patel. "Digging into Big Provenance (with SPADE)". Queue 19, nr 3 (30.06.2021): 77–106. http://dx.doi.org/10.1145/3475965.3476885.

Pełny tekst źródła
Streszczenie:
Several interfaces exist for querying provenance. Many are not flexible in allowing users to select a database type of their choice. Some provide query functionality in a data model that is different from the graph-oriented one that is natural for provenance. Others have intuitive constructs for finding results but have limited support for efficiently chaining responses, as needed for faceted search. This article presents a user interface for querying provenance that addresses these concerns and is agnostic to the underlying database being used.
Style APA, Harvard, Vancouver, ISO itp.
20

Kejriwal, Mayank, Juan Sequeda i Vanessa Lopez. "Knowledge graphs: Construction, management and querying". Semantic Web 10, nr 6 (28.10.2019): 961–62. http://dx.doi.org/10.3233/sw-190370.

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

Rudi, Ali Gholami. "Identifying and Querying Regularly Visited Places". Scientific Annals of Computer Science 19, nr 2 (30.12.2019): 185–201. http://dx.doi.org/10.7561/sacs.2019.2.185.

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

Yadamjav, Munkh-Erdene, Zhifeng Bao, Baihua Zheng, Farhana M. Choudhury i Hanan Samet. "Querying Recurrent Convoys over Trajectory Data". ACM Transactions on Intelligent Systems and Technology 11, nr 5 (5.09.2020): 1–24. http://dx.doi.org/10.1145/3400730.

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

Pereira, Arnaldo, João Rafael Almeida, Rui Pedro Lopes i José Luís Oliveira. "Querying semantic catalogues of biomedical databases". Journal of Biomedical Informatics 137 (styczeń 2023): 104272. http://dx.doi.org/10.1016/j.jbi.2022.104272.

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

Rajaraman, Anand, i Jeffrey D. Ullman. "Querying websites using compact skeletons". Journal of Computer and System Sciences 66, nr 4 (czerwiec 2003): 809–51. http://dx.doi.org/10.1016/s0022-0000(03)00029-1.

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

Bai, Luyi, Li Yan i Z. M. Ma. "Querying fuzzy spatiotemporal data using XQuery". Integrated Computer-Aided Engineering 21, nr 2 (1.03.2014): 147–62. http://dx.doi.org/10.3233/ica-130454.

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

Ricci, F., i H. Werthner. "Case Base Querying for Travel Planning Recommendation". Information Technology & Tourism 4, nr 3 (1.03.2001): 215–26. http://dx.doi.org/10.3727/109830501108751001.

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

CAKMAK, ALI, GULTEKIN OZSOYOGLU i RICHARD W. HANSON. "QUERYING METABOLISM UNDER DIFFERENT PHYSIOLOGICAL CONSTRAINTS". Journal of Bioinformatics and Computational Biology 08, nr 02 (kwiecień 2010): 247–93. http://dx.doi.org/10.1142/s0219720010004604.

Pełny tekst źródła
Streszczenie:
Metabolism is a representation of the biochemical principles that govern the production, consumption, degradation, and biosynthesis of metabolites in living cells. Organisms respond to changes in their physiological conditions or environmental perturbations (i.e. constraints) via cooperative implementation of such principles. Querying inner working principles of metabolism under different constraints provides invaluable insights for both researchers and educators. In this paper, we propose a metabolism query language (MQL) and discuss its query processing. MQL enables researchers to explore the behavior of the metabolism with a wide-range of predicates including dietary and physiological condition specifications. The query results of MQL are enriched with both textual and visual representations, and its query processing is completely tailored based on the underlying metabolic principles.
Style APA, Harvard, Vancouver, ISO itp.
28

Wu, Zongda, Zhongsheng Cao i Yuanzhen Wang. "UMQA: An Internal Algebra for Querying Multimedia Contents". Information Technology Journal 8, nr 4 (1.05.2009): 411–26. http://dx.doi.org/10.3923/itj.2009.411.426.

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

Hasany, N., A. B. Jantan, M. H. B. Selamat i M. I. Saripan. "Querying Ontology using Keywords and Quantitative Restriction Phrases". Information Technology Journal 9, nr 1 (15.12.2009): 67–78. http://dx.doi.org/10.3923/itj.2010.67.78.

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

Demirbas, Murat, Anish Arora i Vinodkrishnan Kulathumani. "Glance: A lightweight querying service for wireless sensor networks". Theoretical Computer Science 410, nr 6-7 (luty 2009): 500–513. http://dx.doi.org/10.1016/j.tcs.2008.10.013.

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

Fionda, Valeria, Giuseppe Pirrò i Mariano P. Consens. "Querying knowledge graphs with extended property paths". Semantic Web 10, nr 6 (28.10.2019): 1127–68. http://dx.doi.org/10.3233/sw-190365.

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

Tré, Guy De, Janusz Kacprzyk, Adnan Yazici i Sławomir Zadrożny. "Advances in fuzzy querying: Theory and applications". International Journal of Intelligent Systems 26, nr 10 (29.07.2011): 887–89. http://dx.doi.org/10.1002/int.20504.

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

Matthé, Tom, Guy De Tré, Sławomir Zadrożny, Janusz Kacprzyk i Antoon Bronselaer. "Bipolar database querying using bipolar satisfaction degrees". International Journal of Intelligent Systems 26, nr 10 (1.08.2011): 890–910. http://dx.doi.org/10.1002/int.20505.

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

Deng, Lei, Zhixiang Chen, Baohua Chen, Yueqi Duan i Jie Zhou. "Incremental image set querying based localization". Neurocomputing 208 (październik 2016): 315–24. http://dx.doi.org/10.1016/j.neucom.2015.11.117.

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

Combi, Carlo, Giuseppe Pozzi i Rosalba Rossato. "Querying temporal clinical databases on granular trends". Journal of Biomedical Informatics 45, nr 2 (kwiecień 2012): 273–91. http://dx.doi.org/10.1016/j.jbi.2011.11.005.

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

Cheng, Siu-Wing, Hyeon-Suk Na, Antoine Vigneron i Yajun Wang. "Querying Approximate Shortest Paths in Anisotropic Regions". SIAM Journal on Computing 39, nr 5 (styczeń 2010): 1888–918. http://dx.doi.org/10.1137/080742166.

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

Goldin, Dina Q., Todd D. Millstein i Ayferi Kutlu. "Bounded similarity querying for time-series data". Information and Computation 194, nr 2 (listopad 2004): 203–41. http://dx.doi.org/10.1016/j.ic.2004.07.001.

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

Doka, Katerina, Dimitrios Tsoumakos i Nectarios Koziris. "Online querying of d-dimensional hierarchies". Journal of Parallel and Distributed Computing 71, nr 3 (marzec 2011): 424–37. http://dx.doi.org/10.1016/j.jpdc.2010.10.005.

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

Segoufin, Luc, i Victor Vianu. "Querying Spatial Databases via Topological Invariants". Journal of Computer and System Sciences 61, nr 2 (październik 2000): 270–301. http://dx.doi.org/10.1006/jcss.2000.1712.

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

Kanza, Yaron, Werner Nutt i Yehoshua Sagiv. "Querying Incomplete Information in Semistructured Data". Journal of Computer and System Sciences 64, nr 3 (maj 2002): 655–93. http://dx.doi.org/10.1006/jcss.2001.1811.

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

Koprulu, Mesru, Nihan Kesim Cicekli i Adnan Yazici. "Spatio-temporal querying in video databases". Information Sciences 160, nr 1-4 (marzec 2004): 131–52. http://dx.doi.org/10.1016/j.ins.2003.08.011.

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

Erozel, Guzen, Nihan Kesim Cicekli i Ilyas Cicekli. "Natural language querying for video databases". Information Sciences 178, nr 12 (czerwiec 2008): 2534–52. http://dx.doi.org/10.1016/j.ins.2008.02.001.

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

Sözer, Aziz, Adnan Yazıcı, Halit Oğuztüzün i Osman Taş. "Modeling and querying fuzzy spatiotemporal databases". Information Sciences 178, nr 19 (październik 2008): 3665–82. http://dx.doi.org/10.1016/j.ins.2008.05.034.

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

Chebotko, Artem, Seunghan Chang, Shiyong Lu i Farshad Fotouhi. "Secure XML querying based on authorization graphs". Information Systems Frontiers 14, nr 3 (5.11.2010): 617–32. http://dx.doi.org/10.1007/s10796-010-9289-2.

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

Du, Shihong, i Luo Guo. "Modeling and querying approximate direction relations". ISPRS Journal of Photogrammetry and Remote Sensing 65, nr 4 (lipiec 2010): 328–40. http://dx.doi.org/10.1016/j.isprsjprs.2010.03.001.

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

Nguyen, Vu-Linh, Sébastien Destercke i Marie-Hélène Masson. "Partial data querying through racing algorithms". International Journal of Approximate Reasoning 96 (maj 2018): 36–55. http://dx.doi.org/10.1016/j.ijar.2018.03.005.

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

Prakasam, Elakkiya, i Arun Manoharan. "A Cache Efficient One Hashing Blocked Bloom Filter (OHBB) for Random Strings and the K-mer Strings in DNA Sequence". Symmetry 14, nr 9 (13.09.2022): 1911. http://dx.doi.org/10.3390/sym14091911.

Pełny tekst źródła
Streszczenie:
Bloom filters are widely used in genome assembly, IoT applications and several network applications such as symmetric encryption algorithms, and blockchain applications owing to their advantages of fast querying, despite some false positives in querying the input elements. There are many research works carried out to improve both the insertion and querying speed or reduce the false-positive or reduce the storage requirements separately. However, the optimization of all the aforementioned parameters is quite challenging with the existing reported systems. This work proposes to simultaneously improve the insertion and querying speeds by introducing a Cache-efficient One-Hashing Blocked Bloom filter. The proposed method aims to reduce the number of memory accesses required for querying elements into one by splitting the memory into blocks where the block size is equal to the cache line size of the memory. In the proposed filter, each block has further been split into partitions where the size of each partition is the prime number. For insertion and query, one hash value is required, which yields different values when modulo divided with prime numbers. The speed is accelerated using simple hash functions where the hash function is called only once. The proposed method has been implemented and validated using random strings and symmetric K-mer datasets used in the gene assembly. The simulation results show that the proposed filter outperforms the Standard Bloom Filter in terms of the insertion and querying speed.
Style APA, Harvard, Vancouver, ISO itp.
48

Cao, Tuan-Dung, i Quang-Minh Nguyen. "Semantic Querying of News Articles With Natural Language Questions". Journal of Information Technology Research 14, nr 3 (lipiec 2021): 38–57. http://dx.doi.org/10.4018/jitr.2021070103.

Pełny tekst źródła
Streszczenie:
The heterogeneity and the increasing amount of the news published on the web create challenges in accessing them. In the authors' previous studies, they introduced a semantic web-based sports news aggregation system called BKSport, which manages to generate metadata for every news item. Providing an intuitive and expressive way to retrieve information and exploiting the advantages of semantic search technique is within their consideration. In this paper, they propose a method to transform natural language questions into SPARQL queries, which could be applied to existing semantic data. This method is mainly based on the following tasks: the construction of a semantic model representing a question, detection of ontology vocabularies and knowledge base elements in question, and their mapping to generate a query. Experiments are performed on a set of questions belonging to various categories, and the results show that the proposed method provides high precision.
Style APA, Harvard, Vancouver, ISO itp.
49

Wang, Hongzhi, i Jianzhong Li. "GXQuery: Extending XQuery for Querying Graph-structured XML Data". Journal of Computing and Information Technology 19, nr 2 (2011): 83. http://dx.doi.org/10.2498/cit.1001006.

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

Almendros-Jiménez, Jesús M., Antonio Becerra-Terón i Manuel Torres. "Integrating and Querying OpenStreetMap and Linked Geo Open Data". Computer Journal 62, nr 3 (23.09.2017): 321–45. http://dx.doi.org/10.1093/comjnl/bxx079.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Możesz być także zainteresowany bibliografiami na temat „Querying (Computer science)” dla innych typów źródeł:
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