Journal articles: 'Database management. Querying (Computer science)'

1

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Bouaziz, Rafik, Salem Chakhar, Vincent Mousseau, Sudha Ram, and Abdelkader Telmoudi. "Database design and querying within the fuzzy semantic model." Information Sciences 177, no. 21 (November 2007): 4598–620. http://dx.doi.org/10.1016/j.ins.2007.05.013.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Kacprzyk, Janusz, and Sławomir Zadrożny. "Computing with words in intelligent database querying: standalone and Internet-based applications." Information Sciences 134, no. 1-4 (May 2001): 71–109. http://dx.doi.org/10.1016/s0020-0255(01)00093-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Yarygina, Anna, and Boris Novikov. "Optimizing resource allocation for approximate real-time query processing." Computer Science and Information Systems 11, no. 1 (2014): 69–88. http://dx.doi.org/10.2298/csis120825063y.

Full text

Abstract:

Query optimization techniques are proved to be essential for high performance of database management systems. In the context of new querying paradigms, such as similarity based search, exact query evaluation is neither computationally feasible nor meaningful, and approximate query evaluation is the only reasonable option. In this paper a problem of resource allocation for approximate evaluation of complex queries is considered. An approximate algorithm for a near-optimal resource allocation is presented, providing the best feasible quality of the output subject to a limited total cost of a query. The results of experiments have shown that the approximate resource allocation algorithm is accurate and efficient.

APA, Harvard, Vancouver, ISO, and other styles

8

Xue, Qiang, Sakti Pramanik, Gang Qiang, and Qiang Zhu. "A hybrid index structure for querying large string databases." International Journal of Electronic Business 3, no. 3/4 (2005): 243. http://dx.doi.org/10.1504/ijeb.2005.007269.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Gammoudi, Aymen, Allel Hadjali, and Boutheina Ben Yaghlane. "Fuzz-TIME: an intelligent system for managing fuzzy temporal information." International Journal of Intelligent Computing and Cybernetics 10, no. 2 (June 12, 2017): 200–222. http://dx.doi.org/10.1108/ijicc-09-2016-0036.

Full text

Abstract:

Purpose Time modeling is a crucial feature in many application domains. However, temporal information often is not crisp, but is subjective and fuzzy. The purpose of this paper is to address the issue related to the modeling and handling of imperfection inherent to both temporal relations and intervals. Design/methodology/approach On the one hand, fuzzy extensions of Allen temporal relations are investigated and, on the other hand, extended temporal relations to define the positions of two fuzzy time intervals are introduced. Then, a database system, called Fuzzy Temporal Information Management and Exploitation (Fuzz-TIME), is developed for the purpose of processing fuzzy temporal queries. Findings To evaluate the proposal, the authors have implemented a Fuzz-TIME system and created a fuzzy historical database for the querying purpose. Some demonstrative scenarios from history domain are proposed and discussed. Research limitations/implications The authors have conducted some experiments on archaeological data to show the effectiveness of the Fuzz-TIME system. However, thorough experiments on large-scale databases are highly desirable to show the behavior of the tool with respect to the performance and time execution criteria. Practical implications The tool developed (Fuzz-TIME) can have many practical applications where time information has to be dealt with. In particular, in several real-world applications like history, medicine, criminal and financial domains, where time is often perceived or expressed in an imprecise/fuzzy manner. Social implications The social implications of this work can be expected, more particularly, in two domains: in the museum to manage, exploit and analysis the piece of information related to archives and historic data; and in the hospitals/medical organizations to deal with time information inherent to data about patients and diseases. Originality/value This paper presents the design and characterization of a novel and intelligent database system to process and manage the imperfection inherent to both temporal relations and intervals.

APA, Harvard, Vancouver, ISO, and other styles

10

Samson, Grace L., Joan Lu, and Aminat A. Showole. "Mining Complex Spatial Patterns: Issues and Techniques." Journal of Information & Knowledge Management 13, no. 02 (June 2014): 1450019. http://dx.doi.org/10.1142/s0219649214500191.

Full text

Abstract:

Spatial data mining is the quantitative study of phenomena that are located in space. This paper investigates methods of mining patterns of a complex spatial data set (which generally describes any kind of data where the location in space of object holds importance). We based this research on the analysis of some spatial characteristics of certain objects. We began with describing the spatial pattern of events or objects with respect to their attributes; we looked at how to describe the spatial nature/characteristics of entities in an environment with respect to their spatial and non-spatial attributes. We also looked at modelling (predictive modelling/knowledge management of complex spatial systems), querying and implementing a complex spatial database (using data structure and algorithms). Critically speaking, the presence of spatial auto-correlation and the fact that continuous data types are always present in spatial data makes it important to create methods, tools and algorithms to mine spatial patterns in a complex spatial data set. This work is particularly useful to researchers in the field of data mining as it contributes a whole lot of knowledge to different application areas of data mining especially spatial data mining. It can also be useful in teaching and likewise for other study purposes.

APA, Harvard, Vancouver, ISO, and other styles

11

Ongaro-Carcy, Régis, Marie-Pier Scott-Boyer, Adrien Dessemond, François Belleau, Mickael Leclercq, Olivier Périn, and Arnaud Droit. "KibioR & Kibio: a new architecture for next-generation data querying and sharing in big biology." Bioinformatics 37, no. 17 (March 5, 2021): 2706–13. http://dx.doi.org/10.1093/bioinformatics/btab157.

Full text

Abstract:

Abstract Motivation The growing production of massive heterogeneous biological data offers opportunities for new discoveries. However, performing multi-omics data analysis is challenging, and researchers are forced to handle the ever-increasing complexity of both data management and evolution of our biological understanding. Substantial efforts have been made to unify biological datasets into integrated systems. Unfortunately, they are not easily scalable, deployable and searchable, locally or globally. Results This publication presents two tools with a simple structure that can help any data provider, organization or researcher, requiring a reliable data search and analysis base. The first tool is Kibio, a scalable and adaptable data storage based on Elasticsearch search engine. The second tool is KibioR, a R package to pull, push and search Kibio datasets or any accessible Elasticsearch-based databases. These tools apply a uniform data exchange model and minimize the burden of data management by organizing data into a decentralized, versatile, searchable and shareable structure. Several case studies are presented using multiple databases, from drug characterization to miRNAs and pathways identification, emphasizing the ease of use and versatility of the Kibio/KibioR framework. Availabilityand implementation Both KibioR and Elasticsearch are open source. KibioR package source is available at https://github.com/regisoc/kibior and the library on CRAN at https://cran.r-project.org/package=kibior. Supplementary information Supplementary data are available at Bioinformatics online.

APA, Harvard, Vancouver, ISO, and other styles

12

Tsai, Chih-Fong, Shih-Wen Ke, Kenneth McGarry, and Ming-Yi Lin. "LocalContent: a personal scientific document retrieval system." Electronic Library 33, no. 3 (June 1, 2015): 373–85. http://dx.doi.org/10.1108/el-08-2013-0148.

Full text

Abstract:

Purpose – The purpose of this paper is to introduce a novel personal scientific document retrieval system. The most common approach taken for the storage of personal documents is to construct a hierarchical folder structure. Most users prefer searching for documents by manually traversing their organizational hierarchy until reaching the location where the target item is stored, then locating the specific documents within its directory or folder. However, this is very time-consuming, especially when the number of personal scientific documents is very large. Unfortunately, related personal information management (PIM) systems, which provide solutions for managing various types of personal information, have thus far made little progress at managing personal scientific documents. Design/methodology/approach – In this paper, we introduce the design of a personal scientific document retrieval system, namely, LocalContent. It is composed of database indexing and retrieval stages. During indexing, term feature extraction from scientific documents is performed by the natural language processing technique. The extracted terms are stored in the inverted index for later retrieval. For retrieval, a graphical user interface is provided by LocalContent, which allows users to search their personal scientific documents. Findings – The evaluation results based on 20 different personal archives taken from 20 graduate students show that LocalContent is simple to use and can facilitate the search for relevant scientific documents. Moreover, these users were willing to have a system which provides specialized search functions like LocalContent to explore their personal scientific documents in the future. Originality/value – LocalContent is a novel scientific document retrieval system and provides several particular functions of LocalContent including displaying the content summary of the query term frequency in each specific section of the retrieved documents, querying by local section specification and providing a number of recommended keywords related to the query terms.

APA, Harvard, Vancouver, ISO, and other styles

13

Ambritta P, Nancy, Poonam N. Railkar, and Parikshit N. Mahalle. "Collaborative Mutual Identity Establishment (CMIE) for the future internet." International Journal of Pervasive Computing and Communications 11, no. 4 (November 2, 2015): 398–417. http://dx.doi.org/10.1108/ijpcc-04-2015-0024.

Full text

Abstract:

Purpose – This paper aims at providing a comparative analysis of the existing protocols that address the security issues in the Future Internet (FI) and also to introduce a Collaborative Mutual Identity Establishment (CMIE) scheme which adopts the elliptical curve cryptography (ECC), to address the issues, such as content integrity, mutual authentication, forward secrecy, auditability and resistance to attacks such as denial-of-service (DoS) and replay attack. Design/methodology/approach – This paper provides a comparative analysis of the existing protocols that address the security issues in the FI and also provides a CMIE scheme, by adopting the ECC and digital signature verification mechanism, to address the issues, such as content integrity, mutual authentication, forward secrecy, auditability and resistance to attacks such as DoS and replay attack. The proposed scheme enables the establishment of secured interactions between devices and entities of the FI. Further, the algorithm is evaluated against Automated Validation of Internet Security Protocols and Application (AVISPA) tool to verify the security solutions that the CMIE scheme has claimed to address to have been effectively achieved in reality. Findings – The algorithm is evaluated against AVISPA tool to verify the security solutions that the CMIE scheme has claimed to address and proved to have been effectively achieved in reality. The proposed scheme enables the establishment of secured interactions between devices and entities of the FI. Research limitations/implications – Considering the Internet of Things (IoT) scenario, another important aspect that is the device-to-location (D2L) aspect has not been considered in this protocol. Major focus of the protocol is centered around the device-to-device (D2D) and device-to-server (D2S) scenarios. Also, IoT basically works upon a confluence of hundreds for protocols that support the achievement of various factors in the IoT, for example Data Distribution Service, Message Queue Telemetry Transport, Extensible Messaging and Presence Protocol, Constrained Application Protocol (CoAP) and so on. Interoperability of the proposed CMIE algorithm with the existing protocols has to be considered to establish a complete model that fits the FI. Further, each request for mutual authentication requires a querying of the database and a computation at each of the participating entities side for verification which could take considerable amount of time. However, for applications that require firm authentication for maintaining and ensuring secure interactions between entities prior to access control and initiation of actual transfer of sensitive information, the negligible difference in computation time can be ignored for the greater benefit that comes with stronger security. Other factors such as quality of service (QoS) (i.e. flexibility of data delivery, resource usage and timing), key management and distribution also need to be considered. However, the user still has the responsibility to choose the required protocol that suits one’s application and serves the purpose. Originality/value – The originality of the work lies in adopting the ECC and digital signature verification mechanism to develop a new scheme that ensures mutual authentication between participating entities in the FI based upon certain user information such as identities. ECC provides efficiency in terms of key size generated and security against main-in-middle attack. The proposed scheme provides secured interactions between devices/entities in the FI.

APA, Harvard, Vancouver, ISO, and other styles

14

Gard, Matthew, Derrick Hasterok, and Jacqueline A. Halpin. "Global whole-rock geochemical database compilation." Earth System Science Data 11, no. 4 (October 17, 2019): 1553–66. http://dx.doi.org/10.5194/essd-11-1553-2019.

Full text

Abstract:

Abstract. Collation and dissemination of geochemical data are critical to promote rapid, creative, and accurate research and place new results in an appropriate global context. To this end, we have compiled a global whole-rock geochemical database, sourced from various existing databases and supplemented with an extensive list of individual publications. Currently the database stands at 1 022 092 samples with varying amounts of associated sample data, including major and trace element concentrations, isotopic ratios, and location information. Spatial and temporal distribution is heterogeneous; however, temporal distributions are enhanced over some previous database compilations, particularly in ages older than ∼ 1000 Ma. Also included are a range of geochemical indices, various naming schema, and physical property estimates computed on a major element normalized version of the geochemical data for quick reference. This compilation will be useful for geochemical studies requiring extensive data sets, in particular those wishing to investigate secular temporal trends. The addition of physical properties, estimated from sample chemistry, represents a unique contribution to otherwise similar geochemical databases. The data are published in .csv format for the purposes of simple distribution, but exist in a structure format acceptable for database management systems (e.g. SQL). One can either manipulate these data using conventional analysis tools such as MATLAB®, Microsoft® Excel, or R, or upload them to a relational database management system for easy querying and management of the data as unique keys already exist. The data set will continue to grow and be improved, and we encourage readers to contact us or other database compilations within about any data that are yet to be included. The data files described in this paper are available at https://doi.org/10.5281/zenodo.2592822 (Gard et al., 2019a).

APA, Harvard, Vancouver, ISO, and other styles

15

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Lutfi, R., M. Gelgon, and J. Martinez. "Structuring and Querying Documents in an Audio Database Management System." Multimedia Tools and Applications 24, no. 2 (November 2004): 105–23. http://dx.doi.org/10.1023/b:mtap.0000036839.24141.9e.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

TRIGANO, PHILIPPE, JEAN-PAUL BARTHES, CATHERINE GREBOVAL, and FRANÇOIS VALLERNAUD. "QUERYING AN OBJECT-ORIENTED DATABASE USING FREE LANGUAGE." International Journal of Pattern Recognition and Artificial Intelligence 04, no. 03 (September 1990): 429–45. http://dx.doi.org/10.1142/s0218001490000265.

Full text

Abstract:

A man-machine interface in natural language for a DataBase Management System (DBMS) called VORAS, based upon semantics, is presented. This DBMS can also be used for knowledge representation, and is well-suited to the design of queries in natural language. The system VORAS is an object-oriented DBMS developed from a specific model of representation called the Property Driven Model (PDM). A user may write a query in natural language. Most of the analysis is done at a semantic level. A syntactic level has been added, to improve the performance of the system. However, it is still possible to use a short-hand style.

APA, Harvard, Vancouver, ISO, and other styles

18

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

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

19

Hudec, Miroslav. "An approach to fuzzy database querying, analysis and realization." Computer Science and Information Systems 6, no. 2 (2009): 127–40. http://dx.doi.org/10.2298/csis0902127h.

Full text

Abstract:

Although the Structured Query Language (SQL) is a very powerful tool, it is unable to satisfy needs for data selection based on linguistic expressions and degrees of truth. The goal of the research whose results are presented in the paper is to capture these expressions and make them suitable for queries. For this purpose the fuzzy generalized logical condition for the WHERE part of SQL was developed. In this way, queries based on linguistic expressions are supported and are accessing relational databases in the same way as with the SQL. Fuzzy query is not only a querying tool; it improves the meaning of a query and extracts additional valuable information. Statistical data about districts of the Slovak Republic are used in the case study. Fuzzy approach has some limitations that would appear in a querying process. These limitations and ideas how to solve them are outlined in this paper.

APA, Harvard, Vancouver, ISO, and other styles

20

Wang, Jia-Wen, Jing-Rong Chang, and Ching-Hsue Cheng. "Flexible fuzzy OWA querying method for hemodialysis database." Soft Computing 10, no. 11 (November 5, 2005): 1031–42. http://dx.doi.org/10.1007/s00500-005-0030-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Xu, Boyan, Ruichu Cai, Zhenjie Zhang, Xiaoyan Yang, Zhifeng Hao, Zijian Li, and Zhihao Liang. "NADAQ: Natural Language Database Querying Based on Deep Learning." IEEE Access 7 (2019): 35012–17. http://dx.doi.org/10.1109/access.2019.2904720.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Holzschuher, Florian, and René Peinl. "Querying a graph database – language selection and performance considerations." Journal of Computer and System Sciences 82, no. 1 (February 2016): 45–68. http://dx.doi.org/10.1016/j.jcss.2015.06.006.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Qtaish, Amjad, and Mohammad T. Alshammari. "A Narrative Review of Storing and Querying XML Documents Using Relational Database." Journal of Information & Knowledge Management 18, no. 04 (December 2019): 1950048. http://dx.doi.org/10.1142/s0219649219500485.

Full text

Abstract:

Extensible Markup Language (XML) has become a common language for data interchange and data representation in the Web. The evolution of the big data environment and the large volume of data which is being represented by XML on the Web increase the challenges in effectively managing such data in terms of storing and querying. Numerous solutions have been introduced to store and query XML data, including the file systems, Object-Oriented Database (OODB), Native XML Database (NXD), and Relational Database (RDB). Previous research attempts indicate that RDB is the most powerful technology for managing XML data to date. Because of the structure variations of XML and RDB, the need to map XML data to an RDB scheme is increased. This growth has prompted numerous researchers and database vendors to propose different approaches to map XML documents to an RDB, translating different types of XPath queries to SQL queries and returning the results to an XML format. This paper aims to comprehensively review most cited and latest mapping approaches and database vendors that use RDB solution to store and query XML documents, in a narrative manner. The advantages and the drawbacks of each approach is discussed, particularly in terms of storing and querying. The paper also provides some insight into managing XML documents using RDB solution in terms of storing and querying and contributes to the XML community.

APA, Harvard, Vancouver, ISO, and other styles

25

Nanopoulos, Alexandros, Maciej Zakrzewicz, Tadeusz Morzy, and Yannis Manolopoulos. "Efficient storage and querying of sequential patterns in database systems⋆." Information and Software Technology 45, no. 1 (January 2003): 23–34. http://dx.doi.org/10.1016/s0950-5849(02)00158-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Nadkarni, Prakash M. "QAV: querying entity-attribute-value metadata in a biomedical database." Computer Methods and Programs in Biomedicine 53, no. 2 (June 1997): 93–103. http://dx.doi.org/10.1016/s0169-2607(97)01815-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Fakheraldien. "An Efficient Middleware for Storing and Querying XML Data in Relational Database Management System." Journal of Computer Science 7, no. 2 (February 1, 2011): 314–19. http://dx.doi.org/10.3844/jcssp.2011.314.319.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Kucuktunc, Onur, Ugur Gudukbay, and Ozgur Ulusoy. "A Natural Language-Based Interface for Querying a Video Database." IEEE Multimedia 14, no. 1 (2007): 83–89. http://dx.doi.org/10.1109/mmul.2007.1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Bais, Hanane, Mustapha Machkour, and Lahcen Koutti. "A Model of a Generic Natural Language Interface for Querying Database." International Journal of Intelligent Systems and Applications 8, no. 2 (February 8, 2016): 35–44. http://dx.doi.org/10.5815/ijisa.2016.02.05.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Majhadi, Khadija, and Mustapha Machkour. "The history and recent advances of Natural Language Interfaces for Databases Querying." E3S Web of Conferences 229 (2021): 01039. http://dx.doi.org/10.1051/e3sconf/202122901039.

Full text

Abstract:

Databases have been always the most important topic in the study of information systems, and an indispensable tool in all information management systems. However, the extraction of information stored in these databases is generally carried out using queries expressed in a computer language, such as SQL (Structured Query Language). This generally has the effect of limiting the number of potential users, in particular non-expert database users who must know the database structure to write such requests. One solution to this problem is to use Natural Language Interface (NLI), to communicate with the database, which is the easiest way to get information. So, the appearance of Natural Language Interfaces for Databases (NLIDB) is becoming a real need and an ambitious goal to translate the user’s query given in Natural Language (NL) into the corresponding one in Database Query Language (DBQL). This article provides an overview of the state of the art of Natural Language Interfaces as well as their architecture. Also, it summarizes the main recent advances on the task of Natural Language Interfaces for databases.

APA, Harvard, Vancouver, ISO, and other styles

31

Borthick, A. Faye, Paul L. Bowen, and Gregory J. Gerard. "Modeling a Business Process and Querying the Resulting Database: Analyzing RFID Data to Develop Business Intelligence." Journal of Information Systems 22, no. 2 (September 1, 2008): 331–50. http://dx.doi.org/10.2308/jis.2008.22.2.331.

Full text

Abstract:

ABSTRACT: This case supports the high-level objective of learning to model business situations to design databases and query them to solve business problems. Students analyze Radio Frequency Identification (RFID) and related fulfillment data to develop business intelligence for a grower of bedding plants selling to big-box retailers. Students prepare a business process diagram to understand the business process; identify objectives for detecting and correcting data errors and analyzing business performance; construct a Resource, Event, Agent (REA) diagram to specify a database design; implement the database and query it to satisfy business objectives; communicate results; document data error correction procedures; and prepare adjusting journal entries. The case is appropriate for students with moderate database querying proficiency. The case's managerial and financial accounting and internal control implications make it suitable for courses in Accounting Information Systems (AIS) and database systems for advanced undergraduate students and in AIS, database, and managerial courses for master's students. The data are supplied in Microsoft Access® databases.

APA, Harvard, Vancouver, ISO, and other styles

32

Borthick, A. Faye, and Mary B. Curtis. "Due Diligence on Fast-Fashion Inventory through Data Querying." Journal of Information Systems 22, no. 1 (March 1, 2008): 77–93. http://dx.doi.org/10.2308/jis.2008.22.1.77.

Full text

Abstract:

In this simulation of a merger and acquisition due diligence engagement for a fast-fashion retailer's inventory account, learners develop IT audit skills by (1) preparing a business process representation, (2) identifying audit objectives for testing management assertions about inventory, (3) designing audit procedures to implement audit objectives, (4) querying data files to execute audit procedures, and (5) communicating results. The simulation develops skills for analyzing data to verify the internal consistency of accounting records and to detect conditions warranting further investigation. The simulation, workable with a database query tool or audit software, is appropriate for students with querying proficiency and audit procedure design capability. The simulation helps bridge the understanding gap between IT auditors and general auditors by enabling novice auditors to experience an auditing situation in which they apply IT audit tools to verify internal consistency of data and detect unusual conditions in an audit of financial statement assertions.

APA, Harvard, Vancouver, ISO, and other styles

33

Eckman, B., P. C. West, C. Barford, and G. Raber. "Intuitive simulation, querying, and visualization for river basin policy and management." IBM Journal of Research and Development 53, no. 3 (May 2009): 7:1–7:18. http://dx.doi.org/10.1147/jrd.2009.5429020.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Lings, BJ. "Database management." Data Processing 28, no. 1 (January 1986): 51. http://dx.doi.org/10.1016/0011-684x(86)90208-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Borthick, A. Faye, and Donald R. Jones. "Creating a Business Process Diagram and Database Queries to Detect Billing Errors and Analyze Calling Patterns for Cell Phone Service." Journal of Information Systems 21, no. 1 (March 1, 2007): 107–22. http://dx.doi.org/10.2308/jis.2007.21.1.107.

Full text

Abstract:

In this case, students develop a business process diagram to understand the business situation and create database queries to detect billing discrepancies and manage costs for corporate cell phone service. Using a database query tool or audit software, students query a database with tables for call details, invoices, invoice details, plan rates, and users on plan. The queries are representative of those that accountants could develop to analyze transaction-level data to detect errors and develop insights about business operations. Query-based approaches to analyzing transaction data can enable businesses to make sense of their operations and ensure that they and their trading partners comply with their mutual agreements. The case is appropriate for students with rudimentary database querying proficiency, e.g., at the level developed by Borthick et al.'s (2001) case on assuring compliance for responses to website referrals. No auditing expertise is needed. The case is appropriate for database analysis in accounting systems courses, compliance auditing in auditing courses, and cost analysis in managerial courses. The database is supplied in the form of a Microsoft Access® database.

APA, Harvard, Vancouver, ISO, and other styles

36

Curé, Oliver, Fadhela Kerdjoudj, David Faye, Chan Le Duc, and Myriam Lamolle. "On The Potential Integration of an Ontology-Based Data Access Approach in NoSQL Stores." International Journal of Distributed Systems and Technologies 4, no. 3 (July 2013): 17–30. http://dx.doi.org/10.4018/jdst.2013070102.

Full text

Abstract:

NoSQL stores are emerging as an efficient alternative to relational database management systems in the context of big data. Many actors in this domain consider that to gain a wider adoption, several extensions have to be integrated. Some of them focus on the ways of proposing more schemas, supporting adapted declarative query languages and providing integrity constraints in order to control data consistency and enhance data quality. The authors consider that these issues can be dealt with in the context of Ontology Based Data Access (OBDA). OBDA is a new data management paradigm that exploits the semantic knowledge represented in ontologies when querying data stored in a database. They provide a proof of concept of OBDA's ability to tackle these three issues in a social application related to the medical domain.

APA, Harvard, Vancouver, ISO, and other styles

37

Dubois, D., H. Prade, and F. Sedes. "Fuzzy logic techniques in multimedia database querying: a preliminary investigation of the potentials." IEEE Transactions on Knowledge and Data Engineering 13, no. 3 (2001): 383–92. http://dx.doi.org/10.1109/69.929896.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Qin, Xiaoyu, Xiaowang Zhang, Muhammad Qasim Yasin, Shujun Wang, Zhiyong Feng, and Guohui Xiao. "SUMA: A Partial Materialization-Based Scalable Query Answering in OWL 2 DL." Data Science and Engineering 6, no. 2 (January 19, 2021): 229–45. http://dx.doi.org/10.1007/s41019-020-00150-0.

Full text

Abstract:

AbstractOntology-mediated querying (OMQ) provides a paradigm for query answering according to which users not only query records at the database but also query implicit information inferred from ontology. A key challenge in OMQ is that the implicit information may be infinite, which cannot be stored at the database and queried by off -the -shelf query engine. The commonly adopted technique to deal with infinite entailments is query rewriting, which, however, comes at the cost of query rewriting at runtime. In this work, the partial materialization method is proposed to ensure that the extension is always finite. The partial materialization technology does not rewrite query but instead computes partial consequences entailed by ontology before the online query. Besides, a query analysis algorithm is designed to ensure the completeness of querying rooted and Boolean conjunctive queries over partial materialization. We also soundly and incompletely expand our method to support highly expressive ontology language, OWL 2 DL. Finally, we further optimize the materialization efficiency by role rewriting algorithm and implement our approach as a prototype system SUMA by integrating off-the-shelf efficient SPARQL query engine. The experiments show that SUMA is complete on each test ontology and each test query, which is the same as Pellet and outperforms PAGOdA. Besides, SUMA is highly scalable on large datasets.

APA, Harvard, Vancouver, ISO, and other styles

39

Borthick, A. Faye, and Donald R. Jones. "Analyzing a Potential Warranty Call Center Budget Overrun: Using Database Queries to Solve Business Problems." Journal of Information Systems 19, no. 1 (March 1, 2005): 97–111. http://dx.doi.org/10.2308/jis.2005.19.1.97.

Full text

Abstract:

In this case, students develop and use database queries to analyze possible causes of a potential budget overrun for telephone warranty service for a company that sells personal computers (PCs). Students query a Microsoft Access® database with tables for sales of PCs, estimates for technician time, employees, technician costs, and service minutes provided. The queries illustrate those that accountants could prepare to analyze transaction-level data to develop insights about business operations. Query-based approaches to analyzing transaction data are likely to become more common as businesses take advantage of the wealth of data available to them for solving business problems and exploiting emerging opportunities. This case is appropriate for students with rudimentary database querying proficiency, e.g., at the level developed by Borthick et al.'s (2001) case on assuring compliance for responses to website referrals.

APA, Harvard, Vancouver, ISO, and other styles

40

Alamri, Sultan. "Spatial data managements in indoor environments." International Journal of Web Information Systems 14, no. 4 (November 5, 2018): 402–22. http://dx.doi.org/10.1108/ijwis-05-2018-0039.

Full text

Abstract:

Purpose With the rapid development of the indoor spaces positioning technologies such as the radio-frequency identification (RFID), Bluetooth and WI-FI, the locations of indoor spatial objects (static or moving) constitute an important foundation for a variety of applications. However, there are many challenges and limitations associated with the structuring and querying of spatial objects in indoor spaces. The purpose of this study is to address the current trends, limitations and future challenges associated with the structuring and querying of spatial objects in indoor spaces. Also it addresses the related features of indoor spaces such as indoor structures, positioning technologies and others. Design/methodology/approach In this paper, the author focuses on understanding the aspects and challenges of spatial database managements in indoor spaces. The author explains the differences between indoor spaces and outdoor spaces. Also examines the issues pertaining to indoor spaces positioning and the impact of different shapes and structures within these spaces. In addition, the author considers the varieties of spatial queries that relate specifically to indoor spaces. Findings Most of the research on data management in indoor spaces does not consider the issues and the challenges associated with indoor positioning such as the overlapping of Wi-Fi. The future trend of the indoor spaces includes included different shapes of indoors beside the current 2D indoor spaces on which the majority of the data structures and query processing for spatial objects have focused on. The diversities of the indoor environments features such as directed floors, multi-floors cases should be considered and studied. Furthermore, indoor environments include many special queries besides the common ones queries that used in outdoor spaces such as KNN, range and temporal queries. These special queries need to be considered in data management and querying of indoor environments. Originality/value To the best of the author’s knowledge, this paper successfully addresses the current trends, limitations and future challenges associated with the structuring and querying of spatial objects in indoor spaces.

APA, Harvard, Vancouver, ISO, and other styles

41

BenAli-Sougui, Ines, Minyar Sassi Hidri, and Amel Grissa-Touzi. "No-FSQL." International Journal of Fuzzy System Applications 5, no. 2 (April 2016): 54–63. http://dx.doi.org/10.4018/ijfsa.2016040104.

Full text

Abstract:

NoSQL (Not only SQL) is an efficient database model for storing and manipulating huge quantities of precise data. However, most NoSQL databases scale well as data grows and often are flexible enough to accommodate imprecise and ambiguous data. This comprehensive hands-on guide presents fundamental concepts and practical solutions for using fuzziness with NoSQL to deals with fuzzy databases (FDB). In this paper, the authors present a graph-based fuzzy NoSQL model to deal with large fuzzy databases while extending the NoSQL one. The authors consider the cypher declarative query language proposed for Neo4j which is the current leader on this market to querying fuzzy databases.

APA, Harvard, Vancouver, ISO, and other styles

42

MAY, WOLFGANG. "XPath-logic and XPathLog: A logic-programming style XML data manipulation language." Theory and Practice of Logic Programming 4, no. 3 (April 16, 2004): 239–87. http://dx.doi.org/10.1017/s147106840300187x.

Full text

Abstract:

We define XPathLog as a Datalog-style extension of XPath. XPathLog provides a clear, declarative language for querying and manipulating XML whose perspectives are especially in XML data integration. In our characterization, the formal semantics is defined wrt. an edge-labeled graph-based model, which covers the XML data model. We give a complete, logic-based characterization of XML data and the main language concept for XML, XPath. XPath-Logic extends the XPath language with variable bindings and embeds it into first-order logic. XPathLog is then the Horn fragment of XPath-Logic, providing a Datalog-style, rule-based language for querying and manipulating XML data. The model-theoretic semantics of XPath-Logic serves as the base of XPathLog as a logic-programming language, whereas also an equivalent answer-set semantics for evaluating XPathLog queries is given. In contrast to other approaches, the XPath syntax and semantics is also used for a declarative specification how the database should be updated: when used in rule heads, XPath filters are interpreted as specifications of elements and properties which should be added to the database.

APA, Harvard, Vancouver, ISO, and other styles

43

Wang, Sheng, Zhifeng Bao, J. Shane Culpepper, and Gao Cong. "A Survey on Trajectory Data Management, Analytics, and Learning." ACM Computing Surveys 54, no. 2 (April 2021): 1–36. http://dx.doi.org/10.1145/3440207.

Full text

Abstract:

Recent advances in sensor and mobile devices have enabled an unprecedented increase in the availability and collection of urban trajectory data, thus increasing the demand for more efficient ways to manage and analyze the data being produced. In this survey, we comprehensively review recent research trends in trajectory data management, ranging from trajectory pre-processing, storage, common trajectory analytic tools, such as querying spatial-only and spatial-textual trajectory data, and trajectory clustering. We also explore four closely related analytical tasks commonly used with trajectory data in interactive or real-time processing. Deep trajectory learning is also reviewed for the first time. Finally, we outline the essential qualities that a trajectory data management system should possess to maximize flexibility.

APA, Harvard, Vancouver, ISO, and other styles

44

HWANG, DOOSUNG, FARSHAD FOTOUHI, and YOUNGJU SON. "A CASE STUDY: DEVELOPMENT OF AN ORGANISM–SPECIFIC PROTEIN INTERACTION DATABASE AND ITS ASSOCIATED TOOLS." International Journal of Cooperative Information Systems 12, no. 02 (June 2003): 225–39. http://dx.doi.org/10.1142/s0218843003000723.

Full text

Abstract:

In this paper, we describe the architecture of a protein interaction database and tools for manipulating Drosophila protein interaction data. The proposed system not only maintains interaction data collected by an experiment, but also associates the interaction data with valuable data from various genomic databases. The system inherits a layered-modular architecture by introducing a wrapper-mediator approach in order to solve the syntactic and semantic heterogeneity among multiple data sources. The component modules for wrapping and integrating the relevant data, querying the database, and visualizing the interaction data among proteins are discussed. The system wrapped the relevant data for 14,000 Drosophila proteins from 5 publicly accessible sources. A web-based query interface is developed to browse the database and a query result can be viewed as in a protein interaction map depicting functional pathways, complexes or networks. Protein interaction maps aid in understanding or predicting potential functions for uncharacterized proteins and in describing their functional networks in a biological context. We show that the proposed approach supports data association and data interoperability in a protein interaction database.

APA, Harvard, Vancouver, ISO, and other styles

45

Medvedev, Danny, Uri Shani, and Dov Dori. "Gaining Insights into Conceptual Models: A Graph-Theoretic Querying Approach." Applied Sciences 11, no. 2 (January 14, 2021): 765. http://dx.doi.org/10.3390/app11020765.

Full text

Abstract:

Modern complex systems include products and services that comprise many interconnected pieces of integrated hardware and software, which are expected to serve humans interacting with them. As technology advances, expectations of a smooth, flawless system operation grow. Model-based systems engineering, an approach based on conceptual models, copes with this challenge. Models help construct formal system representations, visualize them, understand the design, simulate the system, and discover design flaws early on. Modeling tools can benefit tremendously from querying capabilities that enable gaining deep insights into system aspects that direct model observations do not reveal. Querying mechanisms can unveil and explain cause-and-effect phenomena, identify central components, and estimate impacts or risks associated with changes. Being connected networks of system elements, models can be effectively represented as graphs, to which queries are applied. Capitalizing on established graph-theoretic algorithms to solve a large variety of problems can elevate the modeling experience to new levels. To utilize this rich set of capabilities, one must convert the model into a graph and store it in a graph database with no significant loss of information. Applying the appropriate algorithms and translating the query response back to the original intelligible and meaningful diagrammatic and textual model representation is most valuable. We present and demonstrate a querying approach of converting Object-Process Methodology (OPM) ISO 19450 models into graphs, storing them in a Neo4J graph database, and performing queries that answer complex questions on various system aspects, providing key insights into the modeled system or phenomenon and helping to improve the system design.

APA, Harvard, Vancouver, ISO, and other styles

46

BRACHMAN, RONALD J., PETER G. SELFRIDGE, LOREN G. TERVEEN, BORIS ALTMAN, ALEX BORGIDA, FERN HALPER, THOMAS KIRK, ALAN LAZAR, DEBORAH L. McGUINNESS, and LORI ALPERIN RESNICK. "INTEGRATED SUPPORT FOR DATA ARCHAEOLOGY." International Journal of Cooperative Information Systems 02, no. 02 (June 1993): 159–85. http://dx.doi.org/10.1142/s0218215793000083.

Full text

Abstract:

Corporate databases increasingly are being viewed as potentially rich sources of new and valuable knowledge. Various approaches to “discovering” or “mining” such knowledge have been proposed. Here we identify an important and previously ignored discovery task, which we call data archaeology. Data archaeology is a skilled human task, in which the knowledge sought depends on the goals of the analyst, cannot be specified in advance, and emerges only through an iterative process of data segmentation and analysis. We describe a system that supports the data archaeologist with a natural, object-oriented representation of an application domain, a powerful query language and database translation routines, and an easy-to-use and flexible user interface that supports interactive exploration. A formal knowledge representation system provides the core technology that facilitates database integration, querying, and the reuse of queries and query results.

APA, Harvard, Vancouver, ISO, and other styles

47

Borthick, A. Faye, and Paul L. Bowen. "Auditing System Development: Constructing the Meaning of “Systematic and Rational” in the Context of Legacy Code Migration for Vendor Incentives." Journal of Information Systems 22, no. 1 (March 1, 2008): 47–62. http://dx.doi.org/10.2308/jis.2008.22.1.47.

Full text

Abstract:

This simulation affords an opportunity for learning to audit system development for an accounting application. The simulation responds to the growing emphasis on controlling system development for complying with the internal control assurance requirements of Section 404 of the Sarbanes-Oxley Act of 2002 (U.S. House of Representatives). Because of the lack of detailed accounting standards for vendor incentives, learners have to construct a working definition of “systematic and rational” allocation of incentives in order to develop audit objectives and procedures. In the simulation, learners (1) develop objectives for auditing the specific project of migration of legacy code for vendor incentives and the system development for a group of projects, (2) design audit procedures to achieve the audit objectives, (3) execute the audit procedures by querying the databases, and (4) communicate objectives, procedures, and results in a report. The simulation is staged with conversations among audit staff members and the company's system development manager, databases containing application test data and program library transactions, and readiness questions. Although the databases are supplied in the form of Microsoft Access® files, the simulation can be worked with any database query tool. The simulation helps learners develop their capabilities for designing audit objectives and procedures for testing system development and for querying databases.

APA, Harvard, Vancouver, ISO, and other styles

48

He, Qing, and Xiao Qin Li. "Management of Knowledge Base of Expert System for Fault Diagnosis of Rotating Machinery." Applied Mechanics and Materials 44-47 (December 2010): 2935–39. http://dx.doi.org/10.4028/www.scientific.net/amm.44-47.2935.

Full text

Abstract:

Expert system as a computer program can imitate human experts to diagnose fault of rotating machinery quickly and accurately, which makes diagnose automatically and intelligently and offers a guarantee for device operation in security, stability, and high-quality. The performance of diagnosis system will be degraded if the organization and management of fault diagnosis knowledge of rotating machinery that is more and complex are illogical. For this reason, the fault knowledge is divided according to the different parts and stored in databases in the form of production rules. As a result, the querying, modifying, adding, deleting of knowledge can be easily realized by the basic technology of database. Finally, an expert system based on forward-backward hybrid reasoning for general fault diagnosis of main parts of rotating machinery, such as rotor, roll bearing, gear and so on, has been designed, the rotor fault are verified and diagnosis result are accurate. The system is reasonable in structure, rich in information, easy in management and maintenance of data base.

APA, Harvard, Vancouver, ISO, and other styles

49

Song, Dezhao, Frank Schilder, Shai Hertz, Giuseppe Saltini, Charese Smiley, Phani Nivarthi, Oren Hazai, et al. "Building and Querying an Enterprise Knowledge Graph." IEEE Transactions on Services Computing 12, no. 3 (May 1, 2019): 356–69. http://dx.doi.org/10.1109/tsc.2017.2711600.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Kohutyuk, Oksana, Fadi Towfic, M. Heather West Greenlee, and Vasant Honavar. "BioNetwork Bench: Database and Software for Storage, Query, and Analysis of Gene and Protein Networks." Bioinformatics and Biology Insights 6 (January 2012): BBI.S9728. http://dx.doi.org/10.4137/bbi.s9728.

Full text

Abstract:

Gene and protein networks offer a powerful approach for integration of the disparate yet complimentary types of data that result from high-throughput analyses. Although many tools and databases are currently available for accessing such data, they are left unutilized by bench scientists as they generally lack features for effective analysis and integration of both public and private datasets and do not offer an intuitive interface for use by scientists with limited computational expertise. We describe BioNetwork Bench, an open source, user-friendly suite of database and software tools for constructing, querying, and analyzing gene and protein network models. It enables biologists to analyze public as well as private gene expression; interactively query gene expression datasets; integrate data from multiple networks; store and selectively share the data and results. Finally, we describe an application of BioNetwork Bench to the assembly and iterative expansion of a gene network that controls the differentiation of retinal progenitor cells into rod photoreceptors. The tool is available from http://bionetworkbench.sourceforge.net/ Background The emergence of high-throughput technologies has allowed many biological investigators to collect a great deal of information about the behavior of genes and gene products over time or during a particular disease state. Gene and protein networks offer a powerful approach for integration of the disparate yet complimentary types of data that result from such high-throughput analyses. There are a growing number of public databases, as well as tools for visualization and analysis of networks. However, such databases and tools have yet to be widely utilized by bench scientists, as they generally lack features for effective analysis and integration of both public and private datasets and do not offer an intuitive interface for use by biological scientists with limited computational expertise. Results We describe BioNetwork Bench, an open source, user-friendly suite of database and software tools for constructing, querying, and analyzing gene and protein network models. BioNetwork Bench currently supports a broad class of gene and protein network models (eg, weighted and un-weighted, undirected graphs, multi-graphs). It enables biologists to analyze public as well as private gene expression, macromolecular interaction and annotation data; interactively query gene expression datasets; integrate data from multiple networks; query multiple networks for interactions of interest; store and selectively share the data as well as results of analyses. BioNetwork Bench is implemented as a plug-in for, and hence is fully interoperable with, Cytoscape, a popular open-source software suite for visualizing macromolecular interaction networks. Finally, we describe an application of BioNetwork Bench to the problem of assembly and iterative expansion of a gene network that controls the differentiation of retinal progenitor cells into rod photoreceptors. Conclusions BioNetwork Bench provides a suite of open source software for construction, querying, and selective sharing of gene and protein networks. Although initially aimed at a community of biologists interested in retinal development, the tool can be adapted easily to work with other biological systems simply by populating the associated database with the relevant datasets.

APA, Harvard, Vancouver, ISO, and other styles

Journal articles on the topic 'Database management. Querying (Computer science)'

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