Готові списки джерел за темами / Database Operators

Добірка наукової літератури з теми "Database Operators"

Автор: Grafiati
Опубліковано: 6 вересня 2023

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

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

Зміст

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Database Operators".

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

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

Статті в журналах з теми "Database Operators"

1

Demetrovic, J., L. O. Libkin, and I. B. Muchnik. "Database models and closure operators." Cybernetics and Systems Analysis 27, no. 1 (January 1991): 53–67. http://dx.doi.org/10.1007/bf01068647.

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

Bandle, Maximilian, and Jana Giceva. "Database technology for the masses." Proceedings of the VLDB Endowment 14, no. 11 (July 2021): 2483–90. http://dx.doi.org/10.14778/3476249.3476296.

Повний текст джерела
Анотація:
A wealth of technology has evolved around relational databases over decades that has been successfully tried and tested in many settings and use cases. Yet, the majority of it remains overlooked in the pursuit of performance (e.g., NoSQL) or new functionality (e.g., graph data or machine learning). In this paper, we argue that a wide range of techniques readily available in databases are crucial to tackling the challenges the IT industry faces in terms of hardware trends management, growing workloads, and the overall complexity of a rapidly changing application and platform landscape. However, to be truly useful, these techniques must be freed from the legacy component of database engines: relational operators. Therefore, we argue that to make databases more flexible as platforms and to extend their functionality to new data types and operations requires exposing a lower level of abstraction: instead of working with SQL it would be desirable for database engines to compile, optimize, and run a collection of sub-operators for manipulating and managing data, offering them as an external interface. In this paper, we discuss the advantages of this, provide an initial list of such sub-operators, and show how they can be used in practice.
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Sichert, Moritz, and Thomas Neumann. "User-defined operators." Proceedings of the VLDB Endowment 15, no. 5 (January 2022): 1119–31. http://dx.doi.org/10.14778/3510397.3510408.

Повний текст джерела
Анотація:
In recent years, complex data mining and machine learning algorithms have become more common in data analytics. Several specialized systems exist to evaluate these algorithms on ever-growing data sets, which are built to efficiently execute different types of complex analytics queries. However, using these various systems comes at a price. Moving data out of traditional database systems is often slow as it requires exporting and importing data, which is typically performed using the relatively inefficient CSV format. Additionally, database systems usually offer strong ACID guarantees, which are lost when adding new, external systems. This disadvantage can be detrimental to the consistency of the results. Most data scientists still prefer not to use classical database systems for data analytics. The main reason why RDBMS are not used is that SQL is difficult to work with due to its declarative and set-oriented nature, and is not easily extensible. We present User-Defined Operators (UDOs) as a concept to include custom algorithms into modern query engines. Users can write idiomatic code in the programming language of their choice, which is then directly integrated into existing database systems. We show that our implementation can compete with specialized tools and existing query engines while retaining all beneficial properties of the database system.
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Al Marri, Wadha J., Qutaibah Malluhi, Mourad Ouzzani, Mingjie Tang, and Walid G. Aref. "The similarity-aware relational database set operators." Information Systems 59 (July 2016): 79–93. http://dx.doi.org/10.1016/j.is.2015.10.008.

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

Jacyna-Gołda, Ilona, Mariusz Izdebski, Piotr Klimek, and Rostislav Vašek. "Constructing a database structure in the problem of the assignment of air transport operators to commissioned tasks." MATEC Web of Conferences 294 (2019): 04004. http://dx.doi.org/10.1051/matecconf/201929404004.

Повний текст джерела
Анотація:
The article defines the database structure used in the issue of the assignment of air transport operators to commissioned transport tasks. The purpose of the work is to develop a database structure that fulfills the function of recording information, presenting results and processing calculated data. Presenting the database in a modular manner is a new concept of data flow management in the problem of the assignment of air transport operators to tasks. The issue of the assignment of air service operators to tasks is a complex optimization problem. The complexity of the database architecture used in the assignment of operators to tasks depends on the number of modules responsible for individual functions implemented in the process of determining the assignment of operators to tasks. In addition, the paper presents a mathematical model of the assignment of operators to tasks, includes basic data entered into the model and collected in the database, describes the assignment restrictions and the criterion function. In order to solve the problem, an optimization algorithm concept has been proposed to solve the analyzed problem. The problem of the assignment has been presented in the multi-criteria aspect.
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Petrosyan, Arthur S., and Gurgen S. Petrosyan. "Development of Management System for eduroam Database Updated Specification." Mathematical Problems of Computer Science 53 (July 10, 2020): 57–62. http://dx.doi.org/10.51408/1963-0081.

Повний текст джерела
Анотація:
This paper presents a system developed to simplify the eduroam database management. The goal of the eduroam database is to provide the necessary information needed for the operation of the eduroam service and related supporting services like eduroam monitoring, service location maps and usage statistics, as well as the eduroam CAT tool. eduroam database specifications have been updated to the second version and the update has recently become mandatory, requiring many changes for databases of all National Roaming Operators (NRO). The solution presented here can be useful for NRO administrators to simplify the eduroam database management.
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Petrosyan, Arthur, and Gurgen Petrosyan. "Development of Management System for eduroam Database Updated Specification." Mathematical Problems of Computer Science 53 (July 10, 2020): 57–62. http://dx.doi.org/10.51408/1963-0075.

Повний текст джерела
Анотація:
This paper presents a system developed to simplify the eduroam database management. The goal of the eduroam database is to provide the necessary information needed for the operation of the eduroam service and related supporting services like eduroam monitoring, service location maps and usage statistics, as well as the eduroam CAT tool. eduroam database specifications have been updated to the second version and the update has recently become mandatory, requiring many changes for databases of all National Roaming Operators (NRO). The solution presented here can be useful for NRO administrators to simplify the eduroam database management.
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Frieder, O. "Multiprocessor algorithms for relational-database operators on hypercube systems." Computer 23, no. 11 (November 1990): 13–28. http://dx.doi.org/10.1109/2.60877.

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

Jaziri, Wassim, Najla Sassi, and Dhouha Damak. "Using Temporal Versioning and Integrity Constraints for Updating Geographic Databases and Maintaining Their Consistency." Journal of Database Management 26, no. 1 (January 2015): 30–59. http://dx.doi.org/10.4018/jdm.2015010102.

Повний текст джерела
Анотація:
The use of geographic data has become a widespread concern, mainly within applications related to spatial planning and spatial decision-making. Therefore, changing environments require databases adaptable to changes that occur over time. Thus, supporting geographic information evolution is essential and extremely important within changing environments. The evolution is expressed in the geographic database by series of update operations that should maintain its consistency. This paper proposes an approach for updating geographic databases, based on update operators and algorithms of constraints integrity checking. Temporal versioning is used to keep the track of changes. Every version presents the state of the geographic database at a given time. Algorithms of constraints integrity checking allow maintaining the database consistency upon its update. To implement our approach and assist users in the evolution process, the GeoVersioning tool is developed and tested on a sample geographic database.
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Maquen Nino, Gisella Luisa, Franklin Edinson Teran Santa Cruz, Consuelo Ivonne Del Castillo Castro, and Rafael Damian Villon Prieto. "Best Practices for Relational Database Optimization using Microsoft SQL." Universidad Ciencia y Tecnología 26, no. 114 (June 28, 2022): 29–38. http://dx.doi.org/10.47460/uct.v26i114.588.

Повний текст джерела
Анотація:
The main problem when querying a database is the response time. The research was of an applied type, using two databases: control and experimental. Three computers have been used to execute ten queries to the two databases, running 4 consecutive times and obtaining an average. The results found were that, of the ten consultations carried out, seven consultations obtained better results in the experimental DB and three in the control DB. It is concluded that the best practices to optimize a database are: to create clustered indexes on columns frequently used in searches or to perform sorts, create non-clustered indexes on primary or foreign keys that do not have clustered indexes, use calculated columns, operators, and listing of proper columns in queries, however, the use of indexes should be restricted because they affect insert, update, and delete operations. Keywords: relational database, database optimization, SQL, indexing.
Стилі APA, Harvard, Vancouver, ISO та ін.
Більше джерел

Дисертації з теми "Database Operators"

1

Sjö, Kristoffer. "Semantics and Implementation of Knowledge Operators in Approximate Databases." Thesis, Linköping University, Department of Computer and Information Science, 2004. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-2438.

Повний текст джерела
Анотація:

In order that epistemic formulas might be coupled with approximate databases, it is necessary to have a well-defined semantics for the knowledge operator and a method of reducing epistemic formulas to approximate formulas. In this thesis, two possible definitions of a semantics for the knowledge operator are proposed for use together with an approximate relational database:

* One based upon logical entailment (being the dominating notion of knowledge in literature); sound and complete rules for reduction to approximate formulas are explored and found not to be applicable to all formulas.

* One based upon algorithmic computability (in order to be practically feasible); the correspondence to the above operator on the one hand, and to the deductive capability of the agent on the other hand, is explored.

Also, an inductively defined semantics for a"know whether"-operator, is proposed and tested. Finally, an algorithm implementing the above is proposed, carried out using Java, and tested.

Стилі APA, Harvard, Vancouver, ISO та ін.
2

Müller, Ingo [Verfasser], and P. [Akademischer Betreuer] Sanders. "Engineering Aggregation Operators for Relational In-Memory Database Systems / Ingo Müller. Betreuer: P. Sanders." Karlsruhe : KIT-Bibliothek, 2016. http://d-nb.info/1106329953/34.

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

Amenabar, Leire, and Leire Carreras. "Augmented Reality Framework for Supporting and Monitoring Operators during Maintenance Operations in Industrial Environments." Thesis, Högskolan i Skövde, Institutionen för ingenjörsvetenskap, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-15717.

Повний текст джерела
Анотація:
In an ever-changing and demanding world where short assembly and innovation times are indispensable, it is of paramount importance to ensure that the machinery used throughout the whole process of a product are in their best possible condition. This guarantees that the performance of each machine will be optimal, and hence, the process times will be the shortest possible, while the best quality products are obtained. Moreover, having a machine in an impeccable status permits making the necessary changes to it, in order to fulfil the requirements that a more advanced or complex product may have. Maintenance operations and their corresponding trainings have historically been time-consuming, and a vast amount of information has been transmitted from an expert to a newer operator. This means that there has been the need of working with experienced operators to secure that a good service is provided. However, different technologies like augmented reality (AR) have been shown to have a positive impact in the support and monitoring of operators in industrial maintenance operations.The present project gathers information in regard to the framework of AR, with the aim of supporting and monitoring operators in industrial environments. The proposed method consists on the development of an artefact, which would lead to a possible improvement of the already existing solutions. It is believed that the development of an AR application could grant the necessary aid to any operator in maintenance operations. The result of this suggestion is an AR application which superimposes visual information on the physical equipment.
Стилі APA, Harvard, Vancouver, ISO та ін.
4

McCormick, II Donald W. "Towards A Sufficient Set of Mutation Operators for Structured Query Language (SQL)." Thesis, Virginia Tech, 2010. http://hdl.handle.net/10919/32526.

Повний текст джерела
Анотація:
Test suites for database applications depend on adequate test data and real-world test faults for success. An automated tool is available that quantifies test data coverage for database queries written in SQL. An automated tool is also available that mimics real-world faults by mutating SQL, however tests have revealed that these simulated faults do not completely represent real-world faults. This paper demonstrates how half of the mutation operators used by the SQL mutation tool in real-world test suites generated significantly lower detection scores than those from research test suites. Three revised mutation operators are introduced that improve detection scores and contribute toward re-defining a sufficient set of mutation operators for SQL. Finally, a procedure is presented that reduces the test burden by automatically comparing SQL mutants with their original queries.
Master of Science
Стилі APA, Harvard, Vancouver, ISO та ін.
5

BHIDE, ASHWINI M. "ANALYSIS OF ACCIDENTS AND INJURIES OF CONSTRUCTION EQUIPMENT OPERATORS." University of Cincinnati / OhioLINK, 2006. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1147378056.

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

Jäkel, Tobias. "Role-based Data Management." Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2017. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-224416.

Повний текст джерела
Анотація:
Database systems build an integral component of today’s software systems and as such they are the central point for storing and sharing a software system’s data while ensuring global data consistency at the same time. Introducing the primitives of roles and their accompanied metatype distinction in modeling and programming languages, results in a novel paradigm of designing, extending, and programming modern software systems. In detail, roles as modeling concept enable a separation of concerns within an entity. Along with its rigid core, an entity may acquire various roles in different contexts during its lifetime and thus, adapts its behavior and structure dynamically during runtime. Unfortunately, database systems, as important component and global consistency provider of such systems, do not keep pace with this trend. The absence of a metatype distinction, in terms of an entity’s separation of concerns, in the database system results in various problems for the software system in general, for the application developers, and finally for the database system itself. In case of relational database systems, these problems are concentrated under the term role-relational impedance mismatch. In particular, the whole software system is designed by using different semantics on various layers. In case of role-based software systems in combination with relational database systems this gap in semantics between applications and the database system increases dramatically. Consequently, the database system cannot directly represent the richer semantics of roles as well as the accompanied consistency constraints. These constraints have to be ensured by the applications and the database system loses its single point of truth characteristic in the software system. As the applications are in charge of guaranteeing global consistency, their development requires more effort in data management. Moreover, the software system’s data management is distributed over several layers, which results in an unstructured software system architecture. To overcome the role-relational impedance mismatch and bring the database system back in its rightful position as single point of truth in a software system, this thesis introduces the novel and tripartite RSQL approach. It combines a novel database model that represents the metatype distinction as first class citizen in a database system, an adapted query language on the database model’s basis, and finally a proper result representation. Precisely, RSQL’s logical database model introduces Dynamic Data Types, to directly represent the separation of concerns within an entity type on the schema level. On the instance level, the database model defines the notion of a Dynamic Tuple that combines an entity with the notion of roles and thus, allows for dynamic structure adaptations during runtime without changing an entity’s overall type. These definitions build the main data structures on which the database system operates. Moreover, formal operators connecting the query language statements with the database model data structures, complete the database model. The query language, as external database system interface, features an individual data definition, data manipulation, and data query language. Their statements directly represent the metatype distinction to address Dynamic Data Types and Dynamic Tuples, respectively. As a consequence of the novel data structures, the query processing of Dynamic Tuples is completely redesigned. As last piece for a complete database integration of a role-based notion and its accompanied metatype distinction, we specify the RSQL Result Net as result representation. It provides a novel result structure and features functionalities to navigate through query results. Finally, we evaluate all three RSQL components in comparison to a relational database system. This assessment clearly demonstrates the benefits of the roles concept’s full database integration.
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Gonzaga, André dos Santos. "The Similarity-aware Relational Division Database Operator." Universidade de São Paulo, 2017. http://www.teses.usp.br/teses/disponiveis/55/55134/tde-17112017-135006/.

Повний текст джерела
Анотація:
In Relational Algebra, the operator Division (÷) is an intuitive tool used to write queries with the concept of for all, and thus, it is constantly required in real applications. However, as we demonstrate in this MSc work, the division does not support many of the needs common to modern applications, particularly those that involve complex data analysis, such as processing images, audio, genetic data, large graphs, fingerprints, and many other non-traditional data types. The main issue is the existence of intrinsic comparisons of attribute values in the operator, which, by definition, are always performed by identity (=), despite the fact that complex data must be compared by similarity. Recent works focus on supporting similarity comparison in relational operators, but no one treats the division. MSc work proposes the new Similarity-aware Division (÷) operator. Our novel operator is naturally well suited to answer queries with an idea of candidate elements and exigencies to be performed on complex data from real applications of high-impact. For example, it is potentially useful to support agriculture, genetic analyses, digital library search, and even to help controlling the quality of manufactured products and identifying new clients in industry. We validate our proposal by studying the first two of these applications.
O operador de Divisão (÷) da Álgebra Relacional permite representar de forma simples consultas com o conceito de para todos, e por isso é requerido em diversas aplicações reais. Entretanto, evidencia-se neste trabalho de mestrado que a divisão não atende às necessidades de diversas aplicações atuais, principalmente quando estas analisam dados complexos, como imagens, áudio, textos longos, impressões digitais, entre outros. Analisando o problema verifica-se que a principal limitação é a existência de comparações de valores de atributos intrínsecas à Divisão Relacional, que, por definição, são efetuadas sempre por identidade (=), enquanto objetos complexos devem geralmente ser comparados por similaridade. Hoje, encontram-se na literatura propostas de operadores relacionais com suporte à similaridade de objetos complexos, entretanto, nenhuma trata a Divisão Relacional. Este trabalho de mestrado propõe investigar e estender o operador de Divisão da Álgebra Relacional para melhor adequá-lo às demandas de aplicações atuais, por meio de suporte a comparações de valores de atributos por similaridade. Mostra-se aqui que a Divisão por Similaridade é naturalmente adequada a responder consultas diversas com um conceito de elementos candidatos e exigências descrito na monografia, envolvendo dados complexos de aplicações reais de alto impacto, com potencial por exemplo, para apoiar a agricultura, análises de dados genéticos, buscas em bibliotecas digitais, e até mesmo para controlar a qualidade de produtos manufaturados e a identificação de novos clientes em indústrias. Para validar a proposta, propõe-se estudar as duas primeiras aplicações citadas.
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Liknes, Stian. "Database Operations on Multi-Core Processors." Thesis, Norges teknisk-naturvitenskapelige universitet, Institutt for datateknikk og informasjonsvitenskap, 2013. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-22990.

Повний текст джерела
Анотація:
The focus of this thesis is on investigating efficient database algorithmsand methods for modern multi-core processors in main memory environments.We describe central features of modern processors in a historic perspectivebefore presenting a number of general design goals that should beconsidered when optimizing relational operators for multi-corearchitectures. Then, we introduce the skyline operator and relatedalgorithms, including two recent algorithms optimized for multi-coreprocessors. Furthermore, we develop a novel skyline algorithm using anangle-based partitioning scheme originally developed for parallel anddistributed database management systems. Finally, we perform a number ofexperiments in order to evaluate and compare current shared-memory skylinealgorithms.Our experiments reveals some interesting results. Despite of having anexpensive pre-processing step, the angle-based algorithm is able tooutperform current best-performers for multi-core skyline computation.In fact, we are able to outperform competing algorithms by a factor of5 or more for anti-correlated datasets with moderate to largecardinalities. Included algorithms exhibit similar performancecharacteristics for independent datasets, while the more basicalgorithms excel at processing correlated datasets. We observe similarperformance for two small real-life datasets. Whereas, the angle-basedalgorithm is more efficient for a work-intensive real-life datasetcontaining more than 2M 5-dimensional tuples.Based on our results we propose that database research targeted atshared-memory systems is focused not only on basic algorithms but alsomore sophisticated techniques proven effective for parallel anddistributed database management systems. Additionally, we emphasizethat modern processors have very fast inter-thread communicationmechanisms that can be exploited to achieve parallel speedup also forsynchronization-heavy algorithms.
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Behzadnia, Peyman. "Dynamic Energy-Aware Database Storage and Operations." Scholar Commons, 2018. http://scholarcommons.usf.edu/etd/7125.

Повний текст джерела
Анотація:
Energy consumption has become a first-class optimization goal in design and implementation of data-intensive computing systems. This is particularly true in the design of database management systems (DBMS), which is one of the most important servers in software stack of modern data centers. Data storage system is one of the essential components of database and has been under many research efforts aiming at reducing its energy consumption. In previous work, dynamic power management (DPM) techniques that make real-time decisions to transition the disks to low-power modes are normally used to save energy in storage systems. In this research, we tackle the limitations of DPM proposals in previous contributions and design a dynamic energy-aware disk storage system in database servers. We introduce a DPM optimization model integrated with model predictive control (MPC) strategy to minimize power consumption of the disk-based storage system while satisfying given performance requirements. It dynamically determines the state of disks and plans for inter-disk data fragment migration to achieve desirable balance between power consumption and query response time. Furthermore, via analyzing our optimization model to identify structural properties of optimal solutions, a fast-solution heuristic DPM algorithm is proposed that can be integrated in large-scale disk storage systems, where finding the most optimal solution might be long, to achieve near-optimal power saving solution within short periods of computational time. The proposed ideas are evaluated through running simulations using extensive set of synthetic workloads. The results show that our solution achieves up to 1.65 times more energy saving while providing up to 1.67 times shorter response time compared to the best existing algorithm in literature. Stream join is a dynamic and expensive database operation that performs join operation in real-time fashion on continuous data streams. Stream joins, also known as window joins, impose high computational time and potentially higher energy consumption compared to other database operations, and thus we also tackle energy-efficiency of stream join processing in this research. Given that there is a strong linear correlation between energy-efficiency and performance of in-memory parallel join algorithms in database servers, we study parallelization of stream join algorithms on multicore processors to achieve energy efficiency and high performance. Equi-join is the most frequent type of join in query workloads and symmetric hash join (SHJ) algorithm is the most effective algorithm to evaluate equi-joins in data streams. To best of our knowledge, we are the first to propose a shared-memory parallel symmetric hash join algorithm on multi-core CPUs. Furthermore, we introduce a novel parallel hash-based stream join algorithm called chunk-based pairing hash join that aims at elevating data throughput and scalability. We also tackle parallel processing of multi-way stream joins where there are more than two input data streams involved in the join operation. To best of our knowledge, we are also the first to propose an in-memory parallel multi-way hash-based stream join on multicore processors. Experimental evaluation on our proposed parallel algorithms demonstrates high throughput, significant scalability, and low latency while reducing the energy consumption. Our parallel symmetric hash join and chunk-based pairing hash join achieve up to 11 times and 12.5 times more throughput, respectively, compared to that of state-of-the-art parallel stream join algorithm. Also, these two algorithms provide up to around 22 times and 24.5 times more throughput, respectively, compared to that of non-parallel (sequential) stream join computation where there is one processing thread.
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Tomé, Diego Gomes. "A near-data select scan operator for database systems." reponame:Repositório Institucional da UFPR, 2017. http://hdl.handle.net/1884/53293.

Повний текст джерела
Анотація:
Orientador : Eduardo Cunha de Almeida
Coorientador : Marco Antonio Zanata Alves
Dissertação (mestrado) - Universidade Federal do Paraná, Setor de Ciências Exatas, Programa de Pós-Graduação em Informática. Defesa: Curitiba, 21/12/2017
Inclui referências : p. 61-64
Resumo: Um dos grandes gargalos em sistemas de bancos de dados focados em leitura consiste em mover dados em torno da hierarquia de memória para serem processados na CPU. O movimento de dados é penalizado pela diferença de desempenho entre o processador e a memória, que é um problema bem conhecido chamado memory wall. O surgimento de memórias inteligentes, como o novo Hybrid Memory Cube (HMC), permitem mitigar o problema do memory wall executando instruções em chips de lógica integrados a uma pilha de DRAMs. Essas memórias possuem potencial para computação de operações de banco de dados direto em memória além do armazenamento de bancos de dados. O objetivo desta dissertação é justamente a execução do operador algébrico de seleção direto em memória para reduzir o movimento de dados através da memória e da hierarquia de cache. O foco na operação de seleção leva em conta o fato que a leitura de colunas a serem filtradas movem grandes quantidades de dados antes de outras operações como junções (ou seja, otimização push-down). Inicialmente, foi avaliada a execução da operação de seleção usando o HMC como uma DRAM comum. Posteriormente, são apresentadas extensões à arquitetura e ao conjunto de instruções do HMC, chamado HMC-Scan, para executar a operação de seleção próximo aos dados no chip lógico do HMC. Em particular, a extensão HMC-Scan tem o objetivo de resolver internamente as dependências de instruções. Contudo, nós observamos que o HMC-Scan requer muita interação entre a CPU e a memória para avaliar a execução de filtros de consultas. Portanto, numa segunda contribuição, apresentamos a extensão arquitetural HIPE-Scan para diminuir esta interação através da técnica de predicação. A predicação suporta a avaliação de predicados direto em memória sem necessidade de decisões da CPU e transforma dependências de controle em dependências de dados (isto é, execução predicada). Nós implementamos a operação de seleção próximo aos dados nas estratégias de execução de consulta orientada a linha/coluna/vetor para a arquitetura x86 e para nas duas extensões HMC-Scan e HIPE-Scan. Nossas simulações mostram uma melhora de desempenho de até 3.7× para HMC-Scan e 5.6× para HIPE-Scan quando executada a consulta 06 do benchmark TPC-H de 1 GB na estratégia de execução orientada a coluna. Palavras-chave: SGBD em Memória, Cubo de Memória Híbrido, Processamento em Memória.
Abstract: A large burden of processing read-mostly databases consists of moving data around the memory hierarchy rather than processing data in the processor. The data movement is penalized by the performance gap between the processor and the memory, which is the well-known problem called memory wall. The emergence of smart memories, as the new Hybrid Memory Cube (HMC), allows mitigating the memory wall problem by executing instructions in logic chips integrated to a stack of DRAMs. These memories can enable not only in-memory databases but also have potential for in-memory computation of database operations. In this dissertation, we focus on the discussion of near-data query processing to reduce data movement through the memory and cache hierarchy. We focus on the select scan database operator, because the scanning of columns moves large amounts of data prior to other operations like joins (i.e., push-down optimization). Initially, we evaluate the execution of the select scan using the HMC as an ordinary DRAM. Then, we introduce extensions to the HMC Instruction Set Architecture (ISA) to execute our near-data select scan operator inside the HMC, called HMC-Scan. In particular, we extend the HMC ISA with HMC-Scan to internally solve instruction dependencies. To support branch-less evaluation of the select scan and transform control-flow dependencies into data-flow dependencies (i.e., predicated execution) we propose another HMC ISA extension called HIPE-Scan. The HIPE-Scan leads to less iteration between processor and HMC during the execution of query filters that depends on in-memory data. We implemented the near-data select scan in the row/column/vector-wise query engines for x86 and two HMC extensions, HMC-Scan and HIPE-Scan achieving performance improvements of up to 3.7× for HMC-Scan and 5.6× for HIPE-Scan when executing the Query-6 from 1 GB TPC-H database on column-wise. Keywords: In-Memory DBMS, Hybrid Memory Cube, Processing-in-Memory.
Стилі APA, Harvard, Vancouver, ISO та ін.
Більше джерел

Книги з теми "Database Operators"

1

Satellite anomalies: Benefits of a centralized anomaly database and methods for securely sharing information among satellite operators. Santa Monica, CA: RAND, 2014.

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

M, Gaier Eric, and Langley Research Center, eds. Air cargo operations cost database. Hampton, Va: National Aeronautics and Space Administration, Langley Research Center, 1998.

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

M, Gaier Eric, and Langley Research Center, eds. Air cargo operations cost database. Hampton, Va: National Aeronautics and Space Administration, Langley Research Center, 1998.

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

Dominique, Jeunot, ed. Oracle database operator for Windows NT. Redwood Shores, CA: Oracle, 1999.

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

Filippi, Stephen Charles. Implementing relational operations in an object-oriented database. Monterey, Calif: Naval Postgraduate School, 1992.

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

Mavroedis, John. Update operations in indefinite temporal constraint databases. Manchester: UMIST, 1995.

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

A, Watkins William, and Woods Hole Oceanographic Institution, eds. SOUND database of marine animal vocalizations: Structure and operations. Woods Hole, Mass: Woods Hole Oceanographic Institution, 1992.

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

Alston, Darrell W. The instrumentation of a parallel and scalable database computer--the Multi-Backend Database Computer, for benchmarking its complex operations. Monterey, Calif: Naval Postgraduate School, 1989.

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

Glossary of operations research (English-Hindi): Computerised database = Saṅkriyāvijñāna śabdāvalī (Angrejī-Hindī) : kampyuṭarīkr̥ta dāṭābesa. New Delhi: Commission for Scientific and Technical Terminology, Ministry of Human Resource Development, Department of Higher Education, 2013.

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

Kerr, Pauline. US & Soviet naval & air operations in the North Pacific, 1981-1989: A database. Canberra: Peace Research Centre, Research School of Pacific and Asian Studies, The Australian National University, 1996.

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

Частини книг з теми "Database Operators"

1

Beard, Bradley. "Notifying Database Operators." In Practical Maintenance Plans in SQL Server, 189–203. Berkeley, CA: Apress, 2016. http://dx.doi.org/10.1007/978-1-4842-1895-2_12.

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

Trushkowsky, Beth. "Crowd Database Operators." In Encyclopedia of Database Systems, 1–6. New York, NY: Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4899-7993-3_80660-1.

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

Trushkowsky, Beth. "Crowd Database Operators." In Encyclopedia of Database Systems, 684–89. New York, NY: Springer New York, 2018. http://dx.doi.org/10.1007/978-1-4614-8265-9_80660.

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

Zhou, Jingren. "Evaluation of Relational Operators." In Encyclopedia of Database Systems, 1–6. New York, NY: Springer New York, 2017. http://dx.doi.org/10.1007/978-1-4899-7993-3_154-2.

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

Zhou, Jingren. "Evaluation of Relational Operators." In Encyclopedia of Database Systems, 1024–29. Boston, MA: Springer US, 2009. http://dx.doi.org/10.1007/978-0-387-39940-9_154.

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

Zhou, Jingren. "Evaluation of Relational Operators." In Encyclopedia of Database Systems, 1348–54. New York, NY: Springer New York, 2018. http://dx.doi.org/10.1007/978-1-4614-8265-9_154.

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

Nuijten, Alex, and Patrick Barel. "Pagination and Set Operators." In Modern Oracle Database Programming, 107–27. Berkeley, CA: Apress, 2023. http://dx.doi.org/10.1007/978-1-4842-9166-5_5.

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

Yager, Ronald R. "Implementing Quotient Operators in Fuzzy Data Bases Using OWA Operators." In Fuzziness in Database Management Systems, 186–206. Heidelberg: Physica-Verlag HD, 1995. http://dx.doi.org/10.1007/978-3-7908-1897-0_9.

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

Cherniack, Mitch, and Stan Zdonik. "Stream-Oriented Query Languages and Operators." In Encyclopedia of Database Systems, 1–8. New York, NY: Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4899-7993-3_368-2.

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

Maier, David, Jin Li, Peter Tucker, Kristin Tufte, and Vassilis Papadimos. "Semantics of Data Streams and Operators." In Database Theory - ICDT 2005, 37–52. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-30570-5_3.

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

Тези доповідей конференцій з теми "Database Operators"

1

Lee, Seungjae, Changhwa Kim, and Sangkyung Kim. "New Database Operators for Sensor Networks." In 5th ACIS International Conference on Software Engineering Research, Management & Applications (SERA 2007). IEEE, 2007. http://dx.doi.org/10.1109/sera.2007.101.

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

Gold, Brian, Anastassia Ailamaki, Larry Huston, and Babak Falsafi. "Accelerating database operators using a network processor." In the 1st international workshop. New York, New York, USA: ACM Press, 2005. http://dx.doi.org/10.1145/1114252.1114260.

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

Kara, Kaan, and Gustavo Alonso. "Fast and robust hashing for database operators." In 2016 26th International Conference on Field Programmable Logic and Applications (FPL). IEEE, 2016. http://dx.doi.org/10.1109/fpl.2016.7577353.

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

Cieslewicz, John, William Mee, and Kenneth A. Ross. "Cache-conscious buffering for database operators with state." In the Fifth International Workshop. New York, New York, USA: ACM Press, 2009. http://dx.doi.org/10.1145/1565694.1565704.

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

dos Santos, Sairo R., Francis B. Moreira, Tiago R. Kepe, and Marco A. Z. Alves. "Advancing Database System Operators with Near-Data Processing." In 2022 30th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP). IEEE, 2022. http://dx.doi.org/10.1109/pdp55904.2022.00028.

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

Rodiger, Wolf, Tobias Muhlbauer, Philipp Unterbrunner, Angelika Reiser, Alfons Kemper, and Thomas Neumann. "Locality-sensitive operators for parallel main-memory database clusters." In 2014 IEEE 30th International Conference on Data Engineering (ICDE). IEEE, 2014. http://dx.doi.org/10.1109/icde.2014.6816684.

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

Drewes, Tobias, Jan Moritz Joseph, Bala Gurumurthy, David Broneske, Gunter Saake, and Thilo Pionteck. "Efficient Inter-Kernel Communication for OpenCL Database Operators on FPGAs." In 2018 International Conference on Field-Programmable Technology (FPT). IEEE, 2018. http://dx.doi.org/10.1109/fpt.2018.00050.

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

Taniguchi, Tetsuki, and Takeo Fujii. "Interference Management with Beamforming Utilizing Spectrum Database for Micro Operators." In 2020 IEEE 92nd Vehicular Technology Conference (VTC2020-Fall). IEEE, 2020. http://dx.doi.org/10.1109/vtc2020-fall49728.2020.9348725.

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

Jiang, Feng, and Guozhu Liu. "Rough Relational Operators and Rough Entropy in Rough Relational Database." In 2009 Second International Workshop on Knowledge Discovery and Data Mining (WKDD). IEEE, 2009. http://dx.doi.org/10.1109/wkdd.2009.115.

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

Gonzaga, André S., and Robson L. F. Cordeiro. "Fast and Scalable Relational Division on Database Systems." In Simpósio Brasileiro de Banco de Dados. Sociedade Brasileira de Computação - SBC, 2016. http://dx.doi.org/10.5753/sbbd.2016.24323.

Повний текст джерела
Анотація:
The Relational Algebra is composed of several operators to assist queries and data manipulation on Relational Databases. The Relational Division operator, particularly, allows simple representations of several queries involving the concept of “for all”, however, the SQL does not have an explicit implementation for it. In this paper, we compare the performance of the best implementation known for the division operator in SQL, considering different cases of use. We also present a new algorithm for the division, which we implemented through stored procedures. We performed a case study using the relational division to select genetic data. The results showed that our implementation for the relational division is potentially faster than the best implementation in SQL.
Стилі APA, Harvard, Vancouver, ISO та ін.

Звіти організацій з теми "Database Operators"

1

McKee and Poerner. PR-015-08200-R01 PRCI State-of-the-Art Pipeline Pump Station Technology Study. Chantilly, Virginia: Pipeline Research Council International, Inc. (PRCI), September 2008. http://dx.doi.org/10.55274/r0010965.

Повний текст джерела
Анотація:
The overall objectives of the project were to identify major issues for liquid pipeline operations, possible technologies to mitigate these issues, and directions forward for improving overall pipeline operations. The study included a visit to pump stations to inspect the equipment and interview operators. A database of state-of-the-art technologies for pump stations was developed and classified. New technologies were assessed to determine their potential applicability.
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Kolovitch, Haines, and Trench. L52317 Pipeline Facility Incident Data Review and Statistical Analysis. Chantilly, Virginia: Pipeline Research Council International, Inc. (PRCI), December 2008. http://dx.doi.org/10.55274/r0010675.

Повний текст джерела
Анотація:
There is a need to improve the industry understanding of leak sources, failure mechanisms and causes within pipeline facilities through statistical analysis, and to use the findings of this effort to develop a PRCI Facilities Integrity Management Program, if appropriate, by developing processes and/or procedures for reducing/preventing leaks that could affect safety, the environment, and operations. This document presents an analysis of reportable incidents and releases from facilities for hazardous liquid and gas transmission pipeline systems in the U.S. For liquid pipelines, facilities� includes facilities releases studied from the Pipeline Performance Tracking System (PPTS) database for the 8-year period from 1999-2006. Gas transmission facilities releases were studied from the Pipeline and Hazardous Materials Safety Administration (PHMSA) gas transmission database for the 5-year period from 2002-2006 and some additional data obtained from PRCI members that operate gas transmission pipelines. The detailed analysis and examinations presented are directed at providing pipeline operators with the appropriate information to understand the key elements for developing a management system that addresses each type of failure on each type of equipment.
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Skow, Jason, Dongliang Lu, and Smitha Koduru. PR-244-133731-R01 In-line Inspection Crack Tool Performance Evaluation. Chantilly, Virginia: Pipeline Research Council International, Inc. (PRCI), July 2015. http://dx.doi.org/10.55274/r0010580.

Повний текст джерела
Анотація:
This report discusses the findings of a detailed analysis and evaluation of the performance capabilities of various in-line inspection (ILI) technologies for managing pipeline crack threats, including crack colonies, isolated cracks and cracks in pipe seam welds. The foundation for the study was the development of an extensive database of crack inspection data collected from pipeline operators through an industry data mining exercise. The data were validated to ensure completeness consistency and accuracy, and then stored in a database. The database was used to characterize the performance of ILI technologies with respect to detection, identification and sizing of crack features. ILI technologies considered in the study include magnetic and ultrasonic-based technologies. The study resulted in the collection and analysis of over 50,000 crack features that were identified through crack detection ILI technologies, excavation and field NDE in the ditch, or both. The majority of the features included in the database are cracks detected in stress corrosion cracking (SCC) colonies (approximately 30,000), with a more limited number of features (approximately 6,200) detected in the longitudinal seam of the pipe. These data were analyzed using a number of approaches and techniques to establish the current performance specifications for cracking ILI tools and to identify the areas where improvements can be made.
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Chien, Stanley, Lauren Christopher, Yaobin Chen, Mei Qiu, and Wei Lin. Integration of Lane-Specific Traffic Data Generated from Real-Time CCTV Videos into INDOT's Traffic Management System. Purdue University, 2023. http://dx.doi.org/10.5703/1288284317400.

Повний текст джерела
Анотація:
The Indiana Department of Transportation (INDOT) uses about 600 digital cameras along populated Indiana highways in order to monitor highway traffic conditions. The videos from these cameras are currently observed by human operators looking for traffic conditions and incidents. However, it is time-consuming for the operators to scan through all video data from all the cameras in real-time. The main objective of this research was to develop an automatic and real-time system and implement the system at INDOT to monitor traffic conditions and detect incidents automatically. The Transportation and Autonomous Systems Institute (TASI) of the Purdue School of Engineering and Technology at Indiana University-Purdue University Indianapolis (IUPUI) and the INDOT Traffic Management Center have worked together to research and develop a system that monitors the traffic conditions based on the INDOT CCTV video feeds. The proposed system performs traffic flow estimation, incident detection, and the classification of vehicles involved in an incident. The goal was to develop a system and prepare for future implementation. The research team designed the new system, in­cluding the hardware and software components, the currently existing INDOT CCTV system, the database structure for traffic data extracted from the videos, and a user-friendly web-based server for identifying individual lanes on the highway and showing vehicle flowrates of each lane automatically. The preliminary prototype of some system components was implemented in the 2018–2019 JTRP projects, which provided the feasibility and structure of the automatic traffic status extraction from the video feeds. The 2019–2021 JTRP project focused on developing and improving many features’ functionality and computation speed to make the program run in real-time. The specific work in this 2021–2022 JTRP project is to improve the system further and implement it on INDOT’s premises. The system has the following features: vehicle-detection, road boundary detection, lane detection, vehicle count and flowrate detection, traffic condition detection, database development, web-based graphical user interface (GUI), and a hardware specification study. The research team has installed the system on one computer in INDOT for daily road traffic monitoring operations.
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Neuert, Mark, and Smitha Koduru. PR-244-173856-R01 In-line Inspection Crack Tool Reliability and Performance Evaluation. Chantilly, Virginia: Pipeline Research Council International, Inc. (PRCI), June 2019. http://dx.doi.org/10.55274/r0011599.

Повний текст джерела
Анотація:
The ability for operators to make operational and maintenance decisions based on in-line inspection (ILI) data depends on the performance of ILI tools with respect to sizing and detection of crack and stress corrosion cracking (SCC) features. A series of previous Pipeline Research Council International, Inc. (PRCI) projects created a database of ILI tool and pipe excavation data that can be used to evaluate the detection and sizing capabilities of ultrasonic (UT) (NDE-4-E Phase 1, PR-244-133731) and electromagnetic acoustic (EMAT) (NDE-4-E Phase 2, PR-244-153719) ILI technologies. This current project, NDE-4-7 (PR-244-173856), was carried out by C-FER Technologies (1999) Inc. (C-FER) for PRCI. It is Phase 3 of an ongoing industry-wide effort to understand and characterize ILI tool performance. In addition to adding a new data set to the database developed in Phases 1 and 2, estimates of ILI tool performance with respect to rate of detection (ROD), probability of identification (POI), false discovery rate (FDR), and sizing accuracy (SA) were calculated. Two further analyses were performed, namely an investigation of the effect of crack profile data on tool performance and burst pressure estimation, and an evaluation of the reduction in sizing uncertainty attained through multiple measurements of crack features. This document has a related webinar.
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Thost, Veronika, Jan Holste, and Özgür Özçep. On Implementing Temporal Query Answering in DL-Lite. Technische Universität Dresden, 2015. http://dx.doi.org/10.25368/2022.218.

Повний текст джерела
Анотація:
Ontology-based data access augments classical query answering over fact bases by adopting the open-world assumption and by including domain knowledge provided by an ontology. We implemented temporal query answering w.r.t. ontologies formulated in the Description Logic DL-Lite. Focusing on temporal conjunctive queries (TCQs), which combine conjunctive queries via the operators of propositional linear temporal logic, we regard three approaches for answering them: an iterative algorithm that considers all data available; a window-based algorithm; and a rewriting approach, which translates the TCQs to be answered into SQL queries. Since the relevant ontological knowledge is already encoded into the latter queries, they can be answered by a standard database system. Our evaluation especially shows that implementations of both the iterative and the window-based algorithm answer TCQs within a few milliseconds, and that the former achieves a constant performance, even if data is growing over time.
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Chien, Stanley, Yaobin Chen, Lauren Christopher, Mei Qiu, and Zhengming Ding. Road Condition Detection and Classification from Existing CCTV Feed. Purdue University, 2022. http://dx.doi.org/10.5703/1288284317364.

Повний текст джерела
Анотація:
The Indiana Department of Transportation (INDOT) has approximately 500 digital cameras along highways in populated areas of Indiana. These cameras are used to monitor traffic conditions around the clock, all year round. Currently, the videos from these cameras are observed one-by-one by human operators looking for traffic conditions and incidents. The main objective of this research was to develop an automatic, real-time system to monitor traffic conditions and detect incidents automatically. The Transportation and Autonomous Systems Institute (TASI) of the Purdue School of Engineering and Technology at Indiana University-Purdue University Indianapolis (IUPUI) and the Traffic Management Center of INDOT developed a system that monitors the traffic conditions based on the INDOT CCTV video feeds. The proposed system performs traffic flow estimation, incident detection, and classification of vehicles involved in an incident. The research team designed the system, including the hardware and software components added to the existing INDOT CCTV system; the relationship between the added system and the currently existing INDOT system; the database structure for traffic data extracted from the videos; and a user-friendly, web-based server for showing the incident locations automatically. The specific work in this project includes vehicle-detection, road boundary detection, lane detection, vehicle count over time, flow-rate detection, traffic condition detection, database development, web-based graphical user interface (GUI), and a hardware specification study. The preliminary prototype of some system components has been implemented in the Development of Automated Incident Detection System Using Existing ATMS CCT (SPR-4305).
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Morandi, Paula, and Amy Lewis. 2021 IDB Climate Finance Database. Inter-American Development Bank, December 2022. http://dx.doi.org/10.18235/0004645.

Повний текст джерела
Анотація:
Under the current IDBG Corporate Results Framework (CRF) 2020-2023 (https://crf.iadb.org/en), the IDB committed to reach 30% of the total amount approved (including all lending operations) of climate finance during this period. In 2021, the IDB Group - composed of the IDB, IDB Lab (formerly the Multilateral Investment Fund) and IDB Invest - approved US$6 billion in climate finance as per the MDB climate finance tracking methodology. This resource is aimed at development activities carried out by the public and private sectors that reduce greenhouse gas (GHG) emissions and thus mitigate climate change, and/or that reduce vulnerability to climate change and contribute to an adaptation process. The IDB only climate finance in 2021 was equivalent to US$ 4.5 billion.
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Klise, Geoffrey Taylor, Peter Holmes Kobos, Roger Ray Hill, Colin Joseph Hamman, Vipin P. Gupta, Benjamin Bing-Yeh Yang, and Nadav Enbar. PV Reliability Operations and Maintenance (PVROM) Database Initiative: 2014 Project Report. Office of Scientific and Technical Information (OSTI), December 2014. http://dx.doi.org/10.2172/1504104.

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

Robinett, Fred. PR-471-14207-Z03 Evaluation of Field Pump Performance Testing Procedure. Chantilly, Virginia: Pipeline Research Council International, Inc. (PRCI), August 2019. http://dx.doi.org/10.55274/r0011616.

Повний текст джерела
Анотація:
In situ pump performance testing was performed at the TransCanada pipeline Monitor station in Alberta Canada and Liebenthal station in Saskatchewan Canada in accordance with the Field Pump Performance Testing Procedure (PRCI report PR-471-14207-R01). Testing at the Monitor station was performed by Sulzer with two different batches of crude oil with slightly different viscosities and densities. Because of the pipeline operation limitations the flow could not be varied appreciably, however the flow points were near the pumps bep flow and therefore believed to be beneficial. To help validate field pump performance testing techniques measurements were taken using two methods to measure flow and two to measure pump power-in. Testing at the Liebenthal station was performed by TransCanada personnel on one fixed speed and one variable speed unit. All testing was performed with one batch of crude oil. The fixed speed unit power was measured with electrical power to the motor and the variable speed unit power was measured with a torque meter and electrical power. A full description of the Excel sheets used to calculate the field pump performance and the factory test data corrected to field conditions is made. The spreadsheet is included with this report. This work will benefit the liquids pipeline operators by validating the field test procedure, thereby providing assurance and acceptance of the methods. Using these field pump performance testing methods on additional pumps will help populate the database of measured viscous pump performances. This data can then be used to further improve the Hydraulic Institutes viscous correction calculations. Additionally, improved field pump performance measurements will allow the pipeline users to optimize their pipeline operation.
Стилі APA, Harvard, Vancouver, ISO та ін.
Також вас можуть зацікавити розширені добірки на тему "Database Operators" для конкретних типів джерел:
Статті в журналах Дисертації Книги
Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!

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