Log in

Relevant bibliographies by topics / Query formulation / Journal articles

To see the other types of publications on this topic, follow the link: Query formulation.

Journal articles on the topic 'Query formulation'

Author: Grafiati

Published: 4 June 2021

Last updated: 25 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Query formulation.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Wacholder, Nina. "Interactive query formulation." Annual Review of Information Science and Technology 45, no. 1 (2011): 157–96. http://dx.doi.org/10.1002/aris.2011.1440450111.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Cheung, Alvin, and Armando Solar-Lezama. "Computer-Assisted Query Formulation." Foundations and Trends® in Programming Languages 3, no. 1 (2016): 1–94. http://dx.doi.org/10.1561/2500000018.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Dr.A., Mummoorthy, Bhasker B., and Karthik Deep Yadav S.J. "Query Formulation Technique Using of Data Web Mining." Bonfring International Journal of Networking Technologies and Applications 5, no. 1 (2018): 06–08. http://dx.doi.org/10.9756/bijnta.8368.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Saito, Yasunori. "Information seeking and query formulation." Library and Information Science 30 (March 31, 1993): 77–92. http://dx.doi.org/10.46895/lis.30.77.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Bhatia, Sanjiv K., Jitender S. Deogun, and Vijay V. Raghavan. "Conceptual query formulation and retrieval." Journal of Intelligent Information Systems 5, no. 3 (1995): 183–209. http://dx.doi.org/10.1007/bf00962233.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Efthimiadis, Efthimis N., Jeff Huang, Amanda Spink, and Jim Jansen. "Query formulation in web search." Proceedings of the American Society for Information Science and Technology 46, no. 1 (2009): 1–3. http://dx.doi.org/10.1002/meet.2009.1450460131.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Silverstein, Steven H. "An Index Model for Query Formulation." Legal Reference Services Quarterly 10, no. 3 (1990): 115–24. http://dx.doi.org/10.1300/j113v10n03_06.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Wong, S. K. M., and Y. Y. Yao. "Query formulation in linear retrieval models." Journal of the American Society for Information Science 41, no. 5 (1990): 334–41. http://dx.doi.org/10.1002/(sici)1097-4571(199007)41:5<334::aid-asi4>3.0.co;2-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Niemi, Timo, and Kalervo Järvelin. "Advanced query formulation in deductive databases." Information Processing & Management 28, no. 2 (1992): 181–99. http://dx.doi.org/10.1016/0306-4573(92)90045-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Culpepper, J. Shane, Guglielmo Faggioli, Nicola Ferro, and Oren Kurland. "Topic Difficulty: Collection and Query Formulation Effects." ACM Transactions on Information Systems 40, no. 1 (2022): 1–36. http://dx.doi.org/10.1145/3470563.

Full text

Abstract:

Several recent studies have explored the interaction effects between topics, systems, corpora, and components when measuring retrieval effectiveness. However, all of these previous studies assume that a topic or information need is represented by a single query. In reality, users routinely reformulate queries to satisfy an information need. In recent years, there has been renewed interest in the notion of “query variations” which are essentially multiple user formulations for an information need. Like many retrieval models, some queries are highly effective while others are not. This is often

APA, Harvard, Vancouver, ISO, and other styles

11

Vanderschantz, Nicholas, and Annika Hinze. "Children’s query formulation and search result exploration." International Journal on Digital Libraries 22, no. 4 (2021): 385–410. http://dx.doi.org/10.1007/s00799-021-00316-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Taipalus, Toni, Mikko Siponen, and Tero Vartiainen. "Errors and Complications in SQL Query Formulation." ACM Transactions on Computing Education 18, no. 3 (2018): 1–29. http://dx.doi.org/10.1145/3231712.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

ter Hofstede, A. H. M. "Query Formulation as an Information Retrieval Problem." Computer Journal 39, no. 4 (1996): 255–74. http://dx.doi.org/10.1093/comjnl/39.4.255.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Qu, Yipeng, and Joohee Kim. "Enhancing Query Formulation for Universal Image Segmentation." Sensors 24, no. 6 (2024): 1879. http://dx.doi.org/10.3390/s24061879.

Full text

Abstract:

Recent advancements in image segmentation have been notably driven by Vision Transformers. These transformer-based models offer one versatile network structure capable of handling a variety of segmentation tasks. Despite their effectiveness, the pursuit of enhanced capabilities often leads to more intricate architectures and greater computational demands. OneFormer has responded to these challenges by introducing a query-text contrastive learning strategy active during training only. However, this approach has not completely addressed the inefficiency issues in text generation and the contrast

APA, Harvard, Vancouver, ISO, and other styles

15

Mosbah, Mawloud. "Query Refinement into Information Retrieval Systems." Journal of information and organizational sciences 47, no. 1 (2023): 133–51. http://dx.doi.org/10.31341/jios.47.1.7.

Full text

Abstract:

Query, expressing the user need and requirement, has an important role, in aninformation retrieval system, for reaching a high accuracy search. In this paper, wepresent an overview of the different refinement operations that the query may undergo,in the sake to enhance performance of an information retrieval system, such as:automatic query formulation through words prevision, query reformulation, queryexpansion, and query optimization.

APA, Harvard, Vancouver, ISO, and other styles

16

Jarrar, M., and M. D. Dikaiakos. "A Query Formulation Language for the Data Web." IEEE Transactions on Knowledge and Data Engineering 24, no. 5 (2012): 783–98. http://dx.doi.org/10.1109/tkde.2011.41.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

MONZ, CHRISTOF. "Machine learning for query formulation in question answering." Natural Language Engineering 17, no. 4 (2011): 425–54. http://dx.doi.org/10.1017/s1351324910000276.

Full text

Abstract:

AbstractResearch on question answering dates back to the 1960s but has more recently been revisited as part of TREC's evaluation campaigns, where question answering is addressed as a subarea of information retrieval that focuses on specific answers to a user's information need. Whereas document retrieval systems aim to return the documents that are most relevant to a user's query, question answering systems aim to return actual answers to a users question. Despite this difference, question answering systems rely on information retrieval components to identify documents that contain an answer t

APA, Harvard, Vancouver, ISO, and other styles

18

Campbell, Douglas M., David W. Embley, and Bogdan Czejdo. "Graphical query formulation for an entity-relationship model." Data & Knowledge Engineering 2, no. 2 (1987): 89–121. http://dx.doi.org/10.1016/0169-023x(87)90017-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Park, Uchang. "An algebraic formulation of the aggregative closure query." Theoretical Computer Science 166, no. 1-2 (1996): 49–62. http://dx.doi.org/10.1016/0304-3975(95)00081-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Ma, Jiebing, Sourav S Bhowmick, Byron Choi, and Lester Tay. "Theories and Principles Matter: Towards Visually Appealing and Effective Abstraction of Property Graph Queries." Proceedings of the ACM on Management of Data 1, no. 2 (2023): 1–26. http://dx.doi.org/10.1145/3589277.

Full text

Abstract:

Existing visual abstraction of a property graph query by representing it as a labeled atomic graph (LAG) has great potential to democratize the usage of property graph databases as it enables user-friendly visual query formulation without demanding the need to learn a property graph query language e.g., Cypher. Unfortunately, existing LAG-based query interfaces do not embrace HCI principles and psychology theories to inform their design and as a result may have adverse impact on their usability and aesthetics. In this paper, we depart from the classical theory- and principles-oblivious LAG abs

APA, Harvard, Vancouver, ISO, and other styles

21

Hsu, Yen-Chi, Cheng-Yao Hong, Ming-Sui Lee, and Tyng-Luh Liu. "Query-Driven Multi-Instance Learning." Proceedings of the AAAI Conference on Artificial Intelligence 34, no. 04 (2020): 4158–65. http://dx.doi.org/10.1609/aaai.v34i04.5836.

Full text

Abstract:

We introduce a query-driven approach (qMIL) to multi-instance learning where the queries aim to uncover the class labels embodied in a given bag of instances. Specifically, it solves a multi-instance multi-label learning (MIML) problem with a more challenging setting than the conventional one. Each MIML bag in our formulation is annotated only with a binary label indicating whether the bag contains the instance of a certain class and the query is specified by the word2vec of a class label/name. To learn a deep-net model for qMIL, we construct a network component that achieves a generalized com

APA, Harvard, Vancouver, ISO, and other styles

22

Polese, Giuseppe, and Mario Vacca. "Towards a Dialogue Based Interface for Query Synchronization." Interaction Design and Architecture(s), no. 5_6 (March 20, 2009): 31–34. http://dx.doi.org/10.55612/s-5002-005_6-004.

Full text

Abstract:

The query synchronization is one of main issues of schema evolution: when a schema evolves the existing queries could stop working and it becomes necessary to redefine them over the new schema. In this paper, according to the recently recognized importance of advanced query formulation inter- faces, the basic ideas and components underlying an inter- active model of tool for supporting query synchronization are outlined.

APA, Harvard, Vancouver, ISO, and other styles

23

Huang, Kai, Qingqing Ye, Jing Zhao, Xi Zhao, Haibo Hu, and Xiaofang Zhou. "VINCENT." Proceedings of the VLDB Endowment 15, no. 12 (2022): 3634–37. http://dx.doi.org/10.14778/3554821.3554862.

Full text

Abstract:

Exploratory search is a search paradigm that plays a vital role in databases, data mining, and information retrieval to assist users to get familiar with the underlying databases. It supports iterative query formulation to explore the data space. Despite its growing importance, exploratory search on graph-structured data has not received adequate attention in the literature. In this paper, we demonstrate a novel system called Vincent that facilitates an efficient exploratory subgraph search in a graph database containing a large collection of small or medium-sized graphs. By automatically gene

APA, Harvard, Vancouver, ISO, and other styles

24

Saeed, Muhammad Rizwan, Charalampos Chelmis, and Viktor K. Prasanna. "ASQFor: Automatic SPARQL query formulation for the non-expert." AI Communications 31, no. 1 (2018): 19–32. http://dx.doi.org/10.3233/aic-170746.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Taipalus, Toni. "The effects of database complexity on SQL query formulation." Journal of Systems and Software 165 (July 2020): 110576. http://dx.doi.org/10.1016/j.jss.2020.110576.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Lim, Joo-Hwee. "Building Visual Vocabulary for Image Indexation and Query Formulation." Pattern Analysis & Applications 4, no. 2-3 (2001): 125–39. http://dx.doi.org/10.1007/pl00014574.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Hansen, Preben, Anni Järvelin, and Antti Järvelin. "Exploring manual and automatic query formulation in patent IR." Journal of Documentation 69, no. 6 (2013): 873–98. http://dx.doi.org/10.1108/jd-12-2012-0166.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Kajanan, Sangaralingam, Yang Bao, Anindya Datta, Debra VanderMeer, and Kaushik Dutta. "Efficient automatic search query formulation using phrase-level analysis." Journal of the Association for Information Science and Technology 65, no. 5 (2014): 1058–75. http://dx.doi.org/10.1002/asi.23022.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Nakkouzi, Ziad S., and Caroline M. Eastman. "Query formulation for handling negation in information retrieval systems." Journal of the American Society for Information Science 41, no. 3 (1990): 171–82. http://dx.doi.org/10.1002/(sici)1097-4571(199004)41:3<171::aid-asi3>3.0.co;2-p.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Baader, Franz, Meghyn Bienvenu, Carsten Lutz, and Frank Wolter. "Query and Predicate Emptiness in Ontology-Based Data Access." Journal of Artificial Intelligence Research 56 (May 30, 2016): 1–59. http://dx.doi.org/10.1613/jair.4866.

Full text

Abstract:

In ontology-based data access (OBDA), database querying is enriched with an ontology that provides domain knowledge and additional vocabulary for query formulation. We identify query emptiness and predicate emptiness as two central reasoning services in this context. Query emptiness asks whether a given query has an empty answer over all databases formulated in a given vocabulary. Predicate emptiness is defined analogously, but quantifies universally over all queries that contain a given predicate. In this paper, we determine the computational complexity of query emptiness and predicate emptin

APA, Harvard, Vancouver, ISO, and other styles

31

EGYHAZY, C. J. "FROM SOFTWARE REUSE TO DATABASE REUSE." International Journal of Software Engineering and Knowledge Engineering 10, no. 02 (2000): 227–49. http://dx.doi.org/10.1142/s0218194000000134.

Full text

Abstract:

Our principal objective in this paper is to show how we have adapted a domain analysis methodology, used previously in software reuse, to the formulation of a single query against federated databases. Currently, we query federated databases by writing queries against each of the legacy databases, merge the responses, and resolve syntactic and semantic differences manually. Such a solution places unacceptable expectations on most users, thus being impractical. In this paper, we propose an approach that requires the instantiation of a single query_class specification against federated databases,

APA, Harvard, Vancouver, ISO, and other styles

32

Roy, Indradyumna, Venkata Sai Baba Reddy Velugoti, Soumen Chakrabarti, and Abir De. "Interpretable Neural Subgraph Matching for Graph Retrieval." Proceedings of the AAAI Conference on Artificial Intelligence 36, no. 7 (2022): 8115–23. http://dx.doi.org/10.1609/aaai.v36i7.20784.

Full text

Abstract:

Given a query graph and a database of corpus graphs, a graph retrieval system aims to deliver the most relevant corpus graphs. Graph retrieval based on subgraph matching has a wide variety of applications, e.g., molecular fingerprint detection, circuit design, software analysis, and question answering. In such applications, a corpus graph is relevant to a query graph, if the query graph is (perfectly or approximately) a subgraph of the corpus graph. Existing neural graph retrieval models compare the node or graph embeddings of the query-corpus pairs, to compute the relevance scores between the

APA, Harvard, Vancouver, ISO, and other styles

33

Mahdabi, Parvaz, and Fabio Crestani. "Patent Query Formulation by Synthesizing Multiple Sources of Relevance Evidence." ACM Transactions on Information Systems 32, no. 4 (2014): 1–30. http://dx.doi.org/10.1145/2651363.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Shironoshita, E. P., Y. R. Jean-Mary, R. M. Bradley, and M. R. Kabuka. "semCDI: A Query Formulation for Semantic Data Integration in caBIG." Journal of the American Medical Informatics Association 15, no. 4 (2008): 559–68. http://dx.doi.org/10.1197/jamia.m2732.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

de Souza, Solange Nice Alves, Edit Grassiani Lino de Campos, and Andre Roberto Doreto dos Santos. "A Tool for Query Formulation based on Entities and Roles." IEEE Latin America Transactions 4, no. 4 (2006): 279–84. http://dx.doi.org/10.1109/tla.2006.4472124.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Dadashzadeh, Mohammad. "Converting Paradoxs QBE Set Queries Into Access 2000 SQL." Review of Business Information Systems (RBIS) 6, no. 2 (2002): 43–56. http://dx.doi.org/10.19030/rbis.v6i2.4570.

Full text

Abstract:

One of the most important promises of the move to an SQL-based accounting software package has been that it frees the accountant from the necessity of resorting to a programmer when retrieving information from the organization's database in response to unanticipated managerial needs. That promise is founded, in part, on the availability of a very high-level, visual relational query language interface known as Query By Example (QBE). Unfortunately, the implementation of QBE in Microsoft Access 2000 fails to support users in formulating complex queries involving set comparison that tend to arise

APA, Harvard, Vancouver, ISO, and other styles

37

Sengupta, Arijit, and Ramesh Venkataraman. "DocBase." Journal of Database Management 22, no. 4 (2011): 30–56. http://dx.doi.org/10.4018/jdm.2011100102.

Full text

Abstract:

This article introduces a complete storage and retrieval architecture for a database environment for XML documents. DocBase, a prototype system based on this architecture, uses a flexible storage and indexing technique to allow highly expressive queries without the necessity of mapping documents to other database formats. DocBase is an integration of several techniques that include (i) a formal model called Heterogeneous Nested Relations (HNR), (ii) a conceptual model XER (Extensible Entity Relationship), (ii) formal query languages (Document Algebra and Calculus), (iii) a practical query lang

APA, Harvard, Vancouver, ISO, and other styles

38

Saim, Zouairi. "Improving information retrieval bug localization with query reformulation and haar transform." South Florida Journal of Development 5, no. 12 (2024): e4851. https://doi.org/10.46932/sfjdv5n12-069.

Full text

Abstract:

The daily tasks for Developers are searching source code, to find pieces of code to reuse, to find where to implement changes, in order to fix a coming bugs implied by a specific report, using a query. Locating relevant files depends largely on the quality of the query used. This localization is done with a query formed by a few keywords; the effectiveness of returned results depends strongly on this query, which in case of poor formulation it will lead to biased result. In this paper, we use query reformulation technique to reinforce our results related to bug localization with haar transform

APA, Harvard, Vancouver, ISO, and other styles

39

Alencar, Andreza Leite de, and Ana Carolina Salgado. "Improving User Interaction on Ontology-based Peer Data Management Systems." iSys - Brazilian Journal of Information Systems 7, no. 2 (2014): 67–85. http://dx.doi.org/10.5753/isys.2014.252.

Full text

Abstract:

The issue of user interaction for query formulation and execution has been investigated for distributed and dynamic environments, such as Peer Data Management System (PDMS). Many of these PDMS are semantic based and composed by data peers which export schemas that are represented by ontologies. In the literature we can find some proposed PDMS interfaces, but none of them addresses, in a general way, the needs of a PDMS for user interaction. In this work we propose a visual user query interface for ontology-based PDMS. It provides a simple and straightforward interaction with this type of syste

APA, Harvard, Vancouver, ISO, and other styles

40

Yuan, Zifeng, Huey Eng Chua, Sourav S. Bhowmick, Zekun Ye, Wook-Shin Han, and Byron Choi. "Towards plug-and-play visual graph query interfaces." Proceedings of the VLDB Endowment 14, no. 11 (2021): 1979–91. http://dx.doi.org/10.14778/3476249.3476256.

Full text

Abstract:

Canned patterns ( i.e. , small subgraph patterns) in visual graph query interfaces (a.k.a GUI) facilitate efficient query formulation by enabling pattern-at-a-time construction mode. However, existing GUIS for querying large networks either do not expose any canned patterns or if they do then they are typically selected manually based on domain knowledge. Unfortunately, manual generation of canned patterns is not only labor intensive but may also lack diversity for supporting efficient visual formulation of a wide range of subgraph queries. In this paper, we present a novel, generic, and exten

APA, Harvard, Vancouver, ISO, and other styles

41

Azad, Hiteshwar Kumar, Akshay Deepak, and Kumar Abhishek. "Query Expansion for Improving Web Search." Journal of Computational and Theoretical Nanoscience 17, no. 1 (2020): 101–8. http://dx.doi.org/10.1166/jctn.2020.8635.

Full text

Abstract:

The aim of this paper is to retrieve the most relevant expansion words for expanding the initial query of the user in order to enhance the outcomes of web search results. Query expansion plays a major role in reformulating a user’s initial query to a one more pertinent to the user’s intended meaning. The reformulated query is then used to obtain more appropriate outcomes from a large amount of information on the web. The proposed semantic query expansion technique uses Wikipedia and WordNet as data sources. Wikipedia is taken as a base for all query expansions because it is one of the most div

APA, Harvard, Vancouver, ISO, and other styles

42

Sanaei, Mahsa, Fatemeh Azizi, and Hamed Babaei Giglou. "Phoenixes at LLMs4OL 2024 Tasks A, B, and C: Retrieval Augmented Generation for Ontology Learning." Open Conference Proceedings 4 (October 2, 2024): 39–47. http://dx.doi.org/10.52825/ocp.v4i.2482.

Full text

Abstract:

Large language models (LLMs) showed great capabilities in ontology learning (OL) where they automatically extract knowledge from text. In this paper, we proposed a Retrieval Augmented Generation (RAG) formulation for three different tasks of ontology learning defined in the LLMs4OL Challenge at ISWC 2024. For task A - term typing - we considered terms as a query and encoded the query through the Query Encoder model for searching through knowledge base embedding of types embeddings obtained through Context Encoder. Next, using Zero-Shot Prompt template we asked LLM to determine what types are a

APA, Harvard, Vancouver, ISO, and other styles

43

Spavold, J. "Children and databases: an analysis of data entry and query formulation." Journal of Computer Assisted Learning 5, no. 3 (1989): 145–60. http://dx.doi.org/10.1111/j.1365-2729.1989.tb00153.x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Güner, Osman F., Douglas R. Henry, Thomas E. Moock, and Robert S. Pearlman. "Flexible queries in 3D searching. 2. Techniques in 3D query formulation." Tetrahedron Computer Methodology 3, no. 6 (1990): 557–63. http://dx.doi.org/10.1016/0898-5529(90)90158-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Kurylev, V. A. "Formulation of an indirect query processing method for a database computer." Cybernetics 24, no. 6 (1989): 696–706. http://dx.doi.org/10.1007/bf01079141.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Fowler, Richard H., Wendy A. L. Fowler, and Jorge L. Williams. "3D visualization of WWW semantic content for browsing and query formulation." Journal of Network and Computer Applications 20, no. 2 (1997): 135–49. http://dx.doi.org/10.1006/jnca.1997.0042.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Mamedova, Irina Yu, Alexey S. Churin, and Irina A. Оranskaya. "ORIGINALITY OF DESIGN OBJECTS CREATED WITH THE HELP OF NEURAL NETWORKS." Technologies & Quality 60, no. 2 (2023): 62–69. http://dx.doi.org/10.34216/2587-6147-2023-2-60-62-69.

Full text

Abstract:

This article examines in detail the current issue of originality of design objects created using neur- al networks, and denotes that the degree of originality of the result depends on various factors, such as the complexity of the query, the degree of transformation of the original visual image, and the use of various non-neural network models. The article focuses on the importance of understanding artistic originality and plagiarism in design, which helps define the boundaries between unique and borrowed creativity. A careful analysis of the findings led to the conclusion that there is a sign

APA, Harvard, Vancouver, ISO, and other styles

48

Power, Robert A. "Large Catalogue Query Performance in Relational Databases." Publications of the Astronomical Society of Australia 24, no. 1 (2007): 13–20. http://dx.doi.org/10.1071/as06026.

Full text

Abstract:

AbstractThe performance of the mysql and oracle database systems have been compared for a selection of astronomy queries using large catalogues of up to a billion objects. The queries tested are those expected from the astronomy community: general database queries, cone searches, neighbour finding and cross matching. The catalogue preparation, sql query formulation and database performance is presented. Most of the general queries perform adequately when appropriate indexes are present in the database. Each system performs well for cone search queries when the Hierarchical Triangular Mesh spat

APA, Harvard, Vancouver, ISO, and other styles

49

Mahlknecht, Giovanni, Anton Dignös, and Natalija Kozmina. "Modeling and querying facts with period timestamps in data warehouses." International Journal of Applied Mathematics and Computer Science 29, no. 1 (2019): 31–49. http://dx.doi.org/10.2478/amcs-2019-0003.

Full text

Abstract:

Abstract In this paper, we study various ways of representing and querying fact data that are time-stamped with a time period in a data warehouse. The main focus is on how to represent the time periods that are associated with the facts in order to support convenient and efficient aggregations over time. We propose three distinct logical models that represent time periods as sets of all time points in a period (instant model), as pairs of start and end time points of a period (period model), and as atomic units that are explicitly stored in a new period dimension (period∗ model). The period di

APA, Harvard, Vancouver, ISO, and other styles

50

Samantapudi, Rama Krishna Raju, Mukesh Reddy Dhanagari, and Sai Tarun. "Natural Language Query to SQL query generation using LSTMs, Transformers, LLMs and Gen AI." American Journal of Technology 4, no. 1 (2025): 30–55. https://doi.org/10.58425/ajt.v4i1.352.

Full text

Abstract:

Aim: This study examined and assessed how these more sophisticated models, Long Short-Term Memory (LSTM) networks, Transformer architectures, and Large Language Models, can automate SQL query generation from natural language input. Methods: Benchmark datasets from finance and e-commerce domains were drawn upon and compared to evaluate the models’ ability to respond to different query complexities. Results: Transformer-based models with self-attention mechanisms outperformed LSTMs in handling long-range dependencies and complicated query structures by degrees, outperforming LSTMs by 87 % compar

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!