Настройки

Укажите год
-

Небесная энциклопедия

Космические корабли и станции, автоматические КА и методы их проектирования, бортовые комплексы управления, системы и средства жизнеобеспечения, особенности технологии производства ракетно-космических систем

Подробнее
-

Мониторинг СМИ

Мониторинг СМИ и социальных сетей. Сканирование интернета, новостных сайтов, специализированных контентных площадок на базе мессенджеров. Гибкие настройки фильтров и первоначальных источников.

Подробнее

Форма поиска

Поддерживает ввод нескольких поисковых фраз (по одной на строку). При поиске обеспечивает поддержку морфологии русского и английского языка
Ведите корректный номера.
Ведите корректный номера.
Ведите корректный номера.
Ведите корректный номера.
Укажите год
Укажите год
Применить Всего найдено 54. Отображено 54.
03-10-2017 дата публикации

Caching policies for selection and replacement of objects

Номер: US0009779031B2
Автор: Avrilia Floratou, Uday B. Kale, Nimrod Megiddo, Fatma Ozcan, Navneet S. Potti, FLORATOU AVRILIA, KALE UDAY B, MEGIDDO NIMROD, OZCAN FATMA, POTTI NAVNEET S, Floratou Avrilia, Kale Uday B., Megiddo Nimrod, Ozcan Fatma, Potti Navneet S.
Принадлежит: INTERNATIONAL BUSINESS MACHINES CORPORATION, IBM, International Business Machines Corporation

In one embodiment, a computer-implemented method includes inserting a set of accessed objects into a cache, where the set of accessed objects varies in size. An object includes a set of object components, and responsive to receiving a request to access the object, it is determined that the object does not fit into the cache given the set of accessed objects and a total size of the cache. A heuristic algorithm is applied, by a computer processor, to identify in the set of object components one or more object components for insertion into the cache. The heuristic algorithm considers at least a priority of the object compared to priorities of one or more objects in the set of accessed objects. The one or more object components are inserted into the cache.

Подробнее
Номер записи: 1
01-01-2008 дата публикации

XPath containment for index and materialized view matching

Номер: US0007315852B2
Автор: Audrey L. Balmin, Kevin S. Beyer, Roberta Jo Cochrane, Fatma Ozcan, Mir Hamid Pirahesh, BALMIN AUDREY L, BEYER KEVIN S, COCHRANE ROBERTA JO, OZCAN FATMA, PIRAHESH MIR HAMID, BALMIN AUDREY L., BEYER KEVIN S.
Принадлежит: International Business Machines Corporation, IBM, INTERNATIONAL BUSINESS MACHINES CORPORATION

A method for using pre-computed information stored in auxiliary structures to speed up processing of expensive queries on hierarchical documents such as XML documents being queried using XPath. The invention defines a taxonomy of such structures such as indexes and materialized views for storing pre-computed XPath results (PXRs), determines what portion of the query can be evaluated by the structures, and computes the compensation for the results generated by the structures. The invention detects all structures applicable to the query and rewrites the query to use such structures, speeding up the performance of the queries. The invention identifies the matching structures by detecting containment mappings between XPath expressions in the query and the structure. The invention also includes a new representation for XPath expressions that is rich enough to express all features of XPath.

Подробнее
Номер записи: 2
26-09-2017 дата публикации

Parallel data streaming between cloud-based applications and massively parallel systems

Номер: US0009774682B2
Автор: Sangeeta T. Doraiswamy, Marc Hörsken, Fatma Ozcan, Mir H. Pirahesh, DORAISWAMY SANGEETA T, HÖRSKEN MARC, OZCAN FATMA, PIRAHESH MIR H, Doraiswamy Sangeeta T., Hörsken Marc, Ozcan Fatma, Pirahesh Mir H.
Принадлежит: INTERNATIONAL BUSINESS MACHINES CORPORATION, IBM, International Business Machines Corporation

Embodiments relate to parallel data streaming between a first computer system and a second computer system. Aspects include transmitting a request to establish an authenticated connection between a processing job on the first computer system and a process on the second computer system and transmitting a query to the process on the second computer system over the authenticated connection. Aspects further include creating one or more tasks on the first computer system configured to receive data from the second computer system in parallel and reading data received by the one or more tasks by the processing job on the first computer system.

Подробнее
Номер записи: 3
05-05-2020 дата публикации

Accessing tables with heterogeneous partitions

Номер: US0010642741B2
Автор: Avrilia Floratou, Fatma Ozcan, Mir H. Pirahesh, Navneet S. Potti, FLORATOU AVRILIA, OZCAN FATMA, PIRAHESH MIR H, POTTI NAVNEET S, Floratou, Avrilia, Ozcan, Fatma, Pirahesh, Mir H., Potti, Navneet S.
Принадлежит: International Business Machines Corporation, IBM

A computer-implemented method according to one embodiment includes receiving a request for data, locating the data at one or more partitions of a heterogeneously partitioned table, determining an access method associated with each of the one or more partitions, and requesting the data from the one or more partitions, utilizing the access method associated with each of the one or more partitions.

Подробнее
Номер записи: 4
11-02-2021 дата публикации

Query Relaxation Using External Domain Knowledge for Query Answering

Номер: US20210042304A1
Автор: Chuan Lei, Fatma Ozcan, Dorian Boris Miller, Jeffrey Kreulen, Rebecca Geis, LEI CHUAN, OZCAN FATMA, MILLER DORIAN BORIS, KREULEN JEFFREY, GEIS REBECCA, Lei, Chuan, Ozcan, Fatma, Miller, Dorian Boris, Kreulen, Jeffrey, Geis, Rebecca
Принадлежит: International Business Machines Corp

A system, method, and computer readable medium perform a method of query relaxation. A query output from a conversational system is received. At least one search term in the query is identified. Instance data is output to the conversational system in response to determining that the instance data in a data store matches the at least one search term in the query. The computer device outputs the received query to an external domain-specific knowledge source in response to determining that the at least one search term does not the match instance data in the data store. The computer device receives the relaxed data matches from the external domain-specific knowledge source being semantically-related to at least one search term in the query based on a plurality of criteria associated with the query. The computing device generates a response to the query based on contextual information and structural information.

Подробнее
Номер записи: 5
06-09-2018 дата публикации

RICH ENTITIES FOR KNOWLEDGE BASES

Номер: US20180253653A1
Автор: Fatma Ozcan, Abdul H. Quamar, Konstantinos Xirogiannopoulos, OZCAN FATMA, QUAMAR ABDUL H, XIROGIANNOPOULOS KONSTANTINOS, Ozcan, Fatma, Quamar, Abdul H., Xirogiannopoulos, Konstantinos
Принадлежит:

A computer program product, according to one embodiment, includes a computer readable storage medium having program instructions embodied therewith, the program instructions executable by a processor to cause the processor to: identify, by the processor, key concepts in a domain ontology, and use, by the processor, the key concepts to create a rich entity. Identifying the key concepts includes performing centrality analysis of concepts extracted from the domain ontology. Other systems, methods, and computer program products are described in additional embodiments. 1. A computer program product comprising a computer readable storage medium having program instructions embodied therewith , the program instructions executable by a processor to cause the processor to:identify, by the processor, key concepts in a domain ontology, wherein identifying the key concepts includes performing centrality analysis of concepts extracted from the domain ontology; anduse, by the processor, the key concepts to create a rich entity.2. The computer program product of claim 1 , wherein performing the centrality analysis handles inheritance and subclasses of the domain ontology.3. The computer program product of claim 1 , wherein performing the centrality analysis handles unions and complex classes of the domain ontology.4. The computer program product of claim 1 , wherein performing the centrality analysis includes introducing a reverse edge to each edge flowing between concepts in the domain ontology.5. The computer program product of claim 1 , wherein performing the centrality analysis assigns ontology page rank values to each of the ontology concepts claim 1 , wherein identifying the key concepts includes performing statistical separation of the concepts based on the page rank value assigned thereto.6. The computer program product of claim 5 , wherein performing the statistical separation includes using a first derivative of the ontology page rank values.7. The computer program ...

Подробнее
Номер записи: 6
11-05-2010 дата публикации

Method and apparatus for XML query evaluation using early-outs and multiple passes

Номер: US0007716210B2
Автор: Fatma Ozcan, Edison Lao Ting, OZCAN FATMA, TING EDISON LAO
Принадлежит: International Business Machines Corporation, IBM, INTERNATIONAL BUSINESS MACHINES CORPORATION

A method and apparatus is disclosed for XML query evaluation using early-outs and multiple passes to evaluate an XML query. A multi-pass evaluation procedure evaluates the XML query one step at a time as needed to complete evaluation. The multi-pass evaluation procedure evaluates XML queries containing logical expressions such as AND expressions, OR expressions, and implied AND expressions within FOR clauses. Queries containing logical expressions are often satisfied before every component is evaluated. Thus, executing the multi-pass evaluation procedure allows the evaluation to exit early when the veracity of the query is determined, not necessarily when every component has been evaluated. The multi-pass evaluation procedure executes as long as a descendant axis of the XML query need not be evaluated past a child node. When evaluation of a descendant axis past a child node is required, the multi-pass evaluation procedure may switch to a single-pass evaluation procedure to complete evaluation ...

Подробнее
Номер записи: 7
17-08-2021 дата публикации

Transforming an ontology query to an SQL query

Номер: US0011093541B2
Автор: Avrilia Floratou, Fatma Ozcan, FLORATOU AVRILIA, OZCAN FATMA, Floratou, Avrilia, Ozcan, Fatma
Принадлежит: International Business Machines Corporation, IBM

A computer-implemented method according to one embodiment includes receiving an ontology language query, receiving a mapping of an ontology to a relational database, and generating a structured query language (SQL) query, utilizing the ontology language query and the mapping of the ontology to the relational database.

Подробнее
Номер записи: 8
16-01-2007 дата публикации

Context quantifier transformation in XML query rewrite

Номер: US0007165063B2
Автор: Kevin S. Beyer, Roberta J. Cochrane, Fatma Ozcan, Normen Seemann, BEYER KEVIN S, COCHRANE ROBERTA J, OZCAN FATMA, SEEMANN NORMEN, BEYER KEVIN S., COCHRANE ROBERTA J.
Принадлежит: International Business Machines Corporation, IBM, INTERNATIONAL BUSINESS MACHINES CORPORATION

An XML query compilation processor ( 20 ) includes an execution compiler ( 42 ) that transforms an XML query into an executable XML query plan ( 22 ). A query rewrite processor ( 34 ) performs query transformations on the XML query. Said query transformations include transforming an expression input ( 60 ) received by an expression ( 62 ) conditional upon a set of items defined by an output ( 64 ) of the expression ( 62 ) being independent of grouping of items in the expression input ( 60 ).

Подробнее
Номер записи: 9
09-11-2021 дата публикации

Rich entities for knowledge bases

Номер: US0011170306B2
Автор: Fatma Ozcan, Abdul H. Quamar, Konstantinos Xirogiannopoulos, OZCAN FATMA, QUAMAR ABDUL H, XIROGIANNOPOULOS KONSTANTINOS
Принадлежит: International Business Machines Corporation, IBM

According to one embodiment, a computer program product includes a computer readable storage medium having program instructions embodied therewith. The program instructions are executable by a processor to cause the processor to: identify key concepts in a domain ontology, and define a workload as a set of queries. Terms are extracted from each of the queries, and frequent patterns are detected across the set of queries. Maximal patterns are also identified from the frequent patterns detected, while the key concepts and the maximal patterns are used to create a rich entity. Moreover, identifying the key concepts includes performing centrality analysis of concepts extracted from the domain ontology. Other systems, methods, and computer program products are described in additional embodiments.

Подробнее
Номер записи: 10
21-02-2017 дата публикации

Adaptive fragment assignment for processing file data in a database

Номер: US0009576000B2
Автор: Andrey Balmin, Romulo Antonio Pereira Goncalves, Fatma Ozcan, Jonas Traub, BALMIN ANDREY, GONCALVES ROMULO ANTONIO PEREIRA, OZCAN FATMA, TRAUB JONAS, Balmin Andrey, Goncalves Romulo Antonio Pereira, Ozcan Fatma, Traub Jonas
Принадлежит: INTERNATIONAL BUSINESS MACHINES CORPORATION, IBM

Scheduling mechanisms for assigning data in a distributed file system to database workers are provided. In one embodiment, a method of and computer program product for assignment of data blocks to database workers are provided. A request for table data is received. Metadata for a plurality of blocks in a file system is retrieved from a metadata store. Each of the plurality of blocks contains a subset of the table data. A request for work is received from a requestor. An assignment of one or more of the plurality of blocks is provided to the requestor.

Подробнее
Номер записи: 11
19-09-2017 дата публикации

Joining data across a parallel database and a distributed processing system

Номер: US9767149B2
Автор: OZCAN FATMA, PIRAHESH HAMID, TIAN YUANYUAN, ZOU TAO, Ozcan Fatma, Pirahesh Hamid, Tian Yuanyuan, Zou Tao
Принадлежит: IBM, International Business Machines Corporation

Embodiments relate to joining data across a parallel database and a distributed processing system. Aspects include receiving a query on data stored in parallel database T and data stored in distributed processing system L, applying local query predicates and projection to data T to create T′, and applying local query predicates and projection to L to create L′. Based on determining that a size of L′ is less than a size of T′ and that the size of L′ is less than a first threshold, transmitting L′ to the parallel database and executing a join between T′ and L′. Based on determining that a number of the nodes distributed processing system n multiplied by the size of T′ is less than the size of L′ and that the size of T′ is less than a second threshold; transmitting T′ to the distributed processing system and executing a join between T′ and L′.

Подробнее
Номер записи: 12
23-06-2020 дата публикации

Split elimination in mapreduce systems

Номер: US0010691646B2
Автор: Mohamed Eltabakh, Peter J. Haas, Fatma Ozcan, Mir Hamid Pirahesh, John (Yannis) Sismanis, Jan Vondrak, ELTABAKH MOHAMED, HAAS PETER J, OZCAN FATMA, PIRAHESH MIR HAMID, SISMANIS JOHN (YANNIS), VONDRAK JAN, Eltabakh, Mohamed, Haas, Peter J., Ozcan, Fatma, Pirahesh, Mir Hamid, Sismanis, John (Yannis), Vondrak, Jan
Принадлежит: INTERNATIONAL BUSINESS MACHINES CORPORATION, IBM

Embodiments of the present invention relate to elimination of blocks such as splits in distributed processing systems such as MapReduce systems using the Hadoop Distributed Filing System (HDFS). In one embodiment, a method of and computer program product for optimizing queries in distributed processing systems are provided. A query is received. The query includes at least one predicate. The query refers to data. The data includes a plurality of records. Each record comprises a plurality of values in a plurality of attributes. Each record is located in at least one of a plurality of blocks of a distributed file system. Each block has a unique identifier. For each block of the distributed file system, at least one value cluster is determined for an attribute of the plurality of attributes. Each value cluster has a range. The predicate of the query is compared with the at least one value cluster of each block. The query is executed against only those blocks where the predicate is met by at ...

Подробнее
Номер записи: 13
26-10-2021 дата публикации

Reducing response time for queries directed to domain-specific knowledge graph using property graph schema optimization

Номер: US0011157467B2
Автор: Chuan Lei, Abdul Quamar, Vasilis Efthymiou, Fatma Ozcan, Rana Alotaibi, LEI CHUAN, QUAMAR ABDUL, EFTHYMIOU VASILIS, OZCAN FATMA, ALOTAIBI RANA, Lei, Chuan, Quamar, Abdul, Efthymiou, Vasilis, Ozcan, Fatma, Alotaibi, Rana
Принадлежит: INTERNATIONAL BUSINESS MACHINES CORPORATION, IBM

According to one or more embodiments of the present invention, a computer-implemented method for providing a query response includes receiving, by a computing device, a domain-specific knowledge graph. The method further includes generating a first property graph schema, a property graph schema includes vertices, edges, and properties of the domain-specific knowledge graph, wherein the first property graph schema is generated based on an ontology of the domain-specific knowledge graph. The method further includes generating a second property graph schema from a copy of the first property graph schema that is optimized by applying one or more types of relationships in the first property graph schema. The method further includes instantiating a property graph using the second property graph schema. The method further includes receiving a query to obtain particular data from the domain-specific knowledge graph. The method further includes responding to the query using the property graph.

Подробнее
Номер записи: 14
22-12-2016 дата публикации

CACHING POLICIES FOR SELECTION AND REPLACEMENT OF OBJECTS

Номер: US20160371193A1
Автор: Avrilia Floratou, Uday B. Kale, Nimrod Megiddo, Fatma Ozcan, Navneet S. Potti, FLORATOU AVRILIA, KALE UDAY B, MEGIDDO NIMROD, OZCAN FATMA, POTTI NAVNEET S, Floratou Avrilia, Kale Uday B., Megiddo Nimrod, Ozcan Fatma, Potti Navneet S.
Принадлежит:

In one embodiment, a computer-implemented method includes inserting a set of accessed objects into a cache, where the set of accessed objects varies in size. An object includes a set of object components, and responsive to receiving a request to access the object, it is determined that the object does not fit into the cache given the set of accessed objects and a total size of the cache. A heuristic algorithm is applied, by a computer processor, to identify in the set of object components one or more object components for insertion into the cache. The heuristic algorithm considers at least a priority of the object compared to priorities of one or more objects in the set of accessed objects. The one or more object components are inserted into the cache. 1. A computer-implemented method , comprising:inserting a set of accessed objects into a cache, the set of accessed objects varying in size; and determining that the object does not fit into the cache given the set of accessed objects and a total size of the cache;', 'applying, by a computer processor, a heuristic algorithm to identify in the set of object components one or more object components for insertion into the cache, the heuristic algorithm considering at least a priority of the object compared to priorities of one or more objects in the set of accessed objects; and', 'inserting the one or more object components into the cache., 'responsive to receiving a request to access an object, the object comprising a set of object components2. The method of claim 1 , wherein applying the heuristic algorithm comprises:determining that the object is unpopular;wherein at least one of set of object components is excluded from the one or more object components identified for insertion into the cache, responsive to the determinations that the object does not fit in the cache and the object is unpopular.3. The method of claim 1 , wherein the priority of the object and the priorities of the one or more objects in the set of ...

Подробнее
Номер записи: 15
05-12-2017 дата публикации

Dynamic query optimization with pilot runs

Номер: US0009836506B2
Автор: Andrey Balmin, Vuk Ercegovac, Jesse E. Jackson, Konstantinos Karanasos, Marcel Kutsch, Fatma Ozcan, Chunyang Xia, BALMIN ANDREY, ERCEGOVAC VUK, JACKSON JESSE E, KARANASOS KONSTANTINOS, KUTSCH MARCEL, OZCAN FATMA, XIA CHUNYANG, Balmin Andrey, Ercegovac Vuk, Jackson Jesse E., Karanasos Konstantinos, Kutsch Marcel, Ozcan Fatma, Xia Chunyang
Принадлежит: INTERNATIONAL BUSINESS MACHINES CORPORATION, IBM, International Business Machines Corporation

In one embodiment, a computer-implemented method includes selecting one or more sub-expressions of a query during compile time. One or more pilot runs are performed by one or more computer processors. The one or more pilot runs include a pilot run associated with each of one or more of the selected sub-expressions, and each pilot run includes at least partial execution of the associated selected sub-expression. The pilot runs are performed during execution time. Statistics are collected on the one or more pilot runs during performance of the one or more pilot runs. The query is optimized based at least in part on the statistics collected during the one or more pilot runs, where the optimization includes basing cardinality and cost estimates on the statistics collected during the pilot runs.

Подробнее
Номер записи: 16
13-11-2018 дата публикации

Assignment of data within file systems

Номер: US0010127237B2
Автор: Uttam Jain, Nimrod Megiddo, Umar F. Minhas, Fatma Ozcan, Robbert Van Der Linden, JAIN UTTAM, MEGIDDO NIMROD, MINHAS UMAR F, OZCAN FATMA, VAN DER LINDEN ROBBERT, Jain, Uttam, Megiddo, Nimrod, Minhas, Umar F., Ozcan, Fatma, Van Der Linden, Robbert
Принадлежит: International Business Machines Corporation, IBM

The embodiments relate to assigning data to processors of a file system. Metadata associated with respective blocks of data, and an initial batch of the blocks is assigned to nodes of a file system based on the metadata. Unassigned blocks are selectively assigned to one or more of the nodes. The selective assignment includes constructing a linear regression model based on node data, and determining a value for each node based on the linear regression model. Each value is associated with a predicted load corresponding to a new assignment of one or more unassigned blocks.

Подробнее
Номер записи: 17
15-10-2009 дата публикации

OPTIMIZATION OF EXTENSIBLE MARKUP LANGUAGE PATH LANGUAGE (XPATH) EXPRESSIONS IN A DATABASE MANAGEMENT SYSTEM CONFIGURED TO ACCEPT EXTENSIBLE MARKUP LANGUAGE (XML) QUERIES

Номер: US2009259641A1
Автор: BALMIN ANDREY, OZCAN FATMA, TRAN TAM MINH
Принадлежит:

An apparatus, system, and method are disclosed for optimization of XPath expressions in a database management system configured to accept XML queries. Operations of the method include receiving an XQuery representation and partitioning XPath expressions within the XQuery representation into a plurality of XPath expression clusters. The XPath expression clusters may comprise one or more XPath expressions and those in each cluster may operate on a common document. Furthermore, the XPath expressions in each cluster are hierarchically related to each other such that branch nodes of the cluster are executable independent of nodes in other XPath expression clusters. The method also defines merging the one or more XPath expressions into one or more expression trees for each XPath expression cluster. The method generates one or more query execution plans from the one or more XPath expression blocks. The method includes, for each query execution plan, splitting each of the XPath expression blocks ...

Подробнее
Номер записи: 18
04-01-2011 дата публикации

Optimization of extensible markup language path language (XPATH) expressions in a database management system configured to accept extensible markup language (XML) queries

Номер: US0007865502B2
Автор: Andrey Balmin, Fatma Ozcan, Tam Minh Dai Tran, BALMIN ANDREY, OZCAN FATMA, TRAN TAM MINH DAI
Принадлежит: International Business Machines Corporation, IBM, INTERNATIONAL BUSINESS MACHINES CORPORATION

An apparatus, system, and method are disclosed for optimization of XPath expressions in a database management system configured to accept XML queries. Operations of the method include receiving an XQuery representation and partitioning XPath expressions within the XQuery representation into a plurality of XPath expression clusters. The XPath expression clusters may comprise one or more XPath expressions and those in each cluster may operate on a common document. Furthermore, the XPath expressions in each cluster are hierarchically related to each other such that branch nodes of the cluster are executable independent of nodes in other XPath expression clusters. The method also defines merging the one or more XPath expressions into one or more expression trees for each XPath expression cluster. The method generates one or more query execution plans from the one or more XPath expression blocks. The method includes, for each query execution plan, splitting each of the XPath expression blocks into one or more ordered fragments. The method determines a cardinality according to database statistics and an execution cost for each XPath expression block within each query execution plan. Finally, the method determines an aggregate cardinality for each query execution plan and an aggregate execution cost for each query execution plan. Therefore, an XQuery may be optimized at both the global XQuery and local XPath expression block level, improving performance and reducing overhead.

Подробнее
Номер записи: 19
26-06-2008 дата публикации

METHOD AND APPARATUS FOR XML QUERY EVALUATION USING EARLY-OUTS AND MULTIPLE PASSES

Номер: US2008154868A1
Автор: OZCAN FATMA, TING EDISON LAO
Принадлежит:

A method and apparatus is disclosed for XML query evaluation using early-outs and multiple passes to evaluate an XML query. A multi-pass evaluation procedure evaluates the XML query one step at a time as needed to complete evaluation. The multi-pass evaluation procedure evaluates XML queries containing logical expressions such as "AND" expressions, "OR" expressions, and implied "AND" expressions within "FOR" clauses. Queries containing logical expressions are often satisfied before every component is evaluated. Thus, executing the multi-pass evaluation procedure allows the evaluation to exit early when the veracity of the query is determined, not necessarily when every component has been evaluated. The multi-pass evaluation procedure executes as long as a descendant axis of the XML query need not be evaluated past a child node. When evaluation of a descendant axis past a child node is required, the multi-pass evaluation procedure may switch to a single-pass evaluation procedure to complete ...

Подробнее
Номер записи: 20
31-01-2019 дата публикации

Assignment of Data Within File Systems

Номер: US20190034444A1
Автор: Uttam Jain, Nimrod Megiddo, Umar F. Minhas, Fatma Ozcan, Robbert Van Der Linden, JAIN UTTAM, MEGIDDO NIMROD, MINHAS UMAR F, OZCAN FATMA, VAN DER LINDEN ROBBERT, Jain, Uttam, Megiddo, Nimrod, Minhas, Umar F., Ozcan, Fatma, Van Der Linden, Robbert
Принадлежит: International Business Machines Corporation

The embodiments relate to assigning data to processors of a file system. Metadata associated with respective blocks of data, and an initial batch of the blocks is assigned to nodes of a file system based on the metadata. Unassigned blocks are selectively assigned to one or more of the nodes. The selective assignment includes constructing a linear regression model based on node data, and determining a value for each node based on the linear regression model. Each value is associated with a predicted load corresponding to a new assignment of one or more unassigned blocks. 1. A method comprising:assigning an initial batch of blocks of data to nodes of a file system based on gathered metadata; constructing a linear regression model based on node data; and', 'for each node, determining a value based on the linear regression model, wherein each value is associated with a predicted load corresponding to a new assignment of one or more unassigned blocks;, 'selectively assigning unassigned blocks to one or more of the nodes, the selective assignment comprisingadjusting a control factor associated with the selective assignment, the adjustment in response to determining that the predicted load for each node exceeds the control factor; andperforming a second assignment circuit to the nodes based on the adjusted control factor.2. The method of claim 1 , wherein constructing the model comprises:initializing the model based on a set of initial values associated with predicted costs;collecting one or more read metric samples for each of the nodes; anddynamically refining the model based on the collected samples.3. The method of claim 1 , further comprising refining the model with a decay factor claim 1 , wherein the decay factor governs relativity of weight between past samples and a new sample.4. The method of claim 1 , further comprising controlling operation of the selective assignment based on a threshold associated with a time budget claim 1 , including comparing a remaining ...

Подробнее
Номер записи: 21
22-06-2017 дата публикации

Assignment of Data Within File Systems

Номер: US20170177599A1
Автор: Uttam Jain, Nimrod Megiddo, Umar F. Minhas, Fatma Ozcan, Robbert Van Der Linden, JAIN UTTAM, MEGIDDO NIMROD, MINHAS UMAR F, OZCAN FATMA, VAN DER LINDEN ROBBERT, Jain Uttam, Megiddo Nimrod, Minhas Umar F., Ozcan Fatma, Van Der Linden Robbert
Принадлежит: International Business Machines Corporation

The embodiments relate to assigning data to processors of a file system. Metadata associated with respective blocks of data, and an initial batch of the blocks is assigned to nodes of a file system based on the metadata. Unassigned blocks are selectively assigned to one or more of the nodes. The selective assignment includes constructing a linear regression model based on node data, and determining a value for each node based on the linear regression model. Each value is associated with a predicted load corresponding to a new assignment of one or more unassigned blocks. 1. A method comprising:gathering metadata associated with respective blocks of data;assigning an initial batch of the blocks to nodes of a file system based on the gathered metadata; and constructing a linear regression model based on node data; and', 'for each node, determining a value based on the linear regression model, wherein each value is associated with a predicted load corresponding to a new assignment of one or more unassigned blocks., 'selectively assigning unassigned blocks to one or more of the nodes, the selective assignment comprising2. The method of claim 1 , further comprising initializing a control factor associated with the selective assignment claim 1 , wherein the control factor controls a maximum permitted block load per node.3. The method of claim 2 , wherein the selective assignment of the unassigned blocks further comprises performing a first assignment circuit claim 2 , including:comparing a first predicted value associated with a first node to the control factor;in response to determining that the predicted value associated with the first node is less than the control factor, assigning the new assignment to the first node; andin response to determining that the predicted value associated with the first node exceeds the control factor, comparing a second predicted value associated with a second node to the control factor to determine if the new assignment is assignable to ...

Подробнее
Номер записи: 22
19-05-2005 дата публикации

Context quantifier transformation in XML query rewrite

Номер: US2005108209A1
Автор: BEYER KEVIN S, COCHRANE ROBERTA J, OZCAN FATMA, SEEMANN NORMEN, BEYER KEVIN S., COCHRANE ROBERTA J.
Принадлежит:

An XML query compilation processor ( 20 ) includes an execution compiler ( 42 ) that transforms an XML query into an executable XML query plan ( 22 ). A query rewrite processor ( 34 ) performs query transformations on the XML query. Said query transformations include transforming an expression input ( 60 ) received by an expression ( 62 ) conditional upon a set of items defined by an output ( 64 ) of the expression ( 62 ) being independent of grouping of items in the expression input ( 60 ).

Подробнее
Номер записи: 23
16-03-2017 дата публикации

CACHING POLICIES FOR SELECTION AND REPLACEMENT OF OBJECTS

Номер: US20170075819A1
Автор: Avrilia Floratou, Uday B. Kale, Nimrod Megiddo, Fatma Ozcan, Navneet S. Potti, FLORATOU AVRILIA, KALE UDAY B, MEGIDDO NIMROD, OZCAN FATMA, POTTI NAVNEET S, Floratou Avrilia, Kale Uday B., Megiddo Nimrod, Ozcan Fatma, Potti Navneet S.
Принадлежит:

In one embodiment, a computer-implemented method includes inserting a set of accessed objects into a cache, where the set of accessed objects varies in size. An object includes a set of object components, and responsive to receiving a request to access the object, it is determined that the object does not fit into the cache given the set of accessed objects and a total size of the cache. A heuristic algorithm is applied, by a computer processor, to identify in the set of object components one or more object components for insertion into the cache. The heuristic algorithm considers at least a priority of the object compared to priorities of one or more objects in the set of accessed objects. The one or more object components are inserted into the cache. 1. A computer-implemented method , comprising:inserting a set of accessed objects into a cache, the set of accessed objects varying in size; and determining that the object does not fit into the cache given the set of accessed objects and a total size of the cache;', 'applying, by a computer processor, a heuristic algorithm to identify in the set of object components one or more object components for insertion into the cache, the heuristic algorithm considering at least a priority of the object compared to priorities of one or more objects in the set of accessed objects; and', 'inserting the one or more object components into the cache., 'responsive to receiving a request to access an object, the object comprising a set of object components2. The method of claim 1 , wherein applying the heuristic algorithm comprises:determining that the object is unpopular;wherein at least one of set of object components is excluded from the one or more object components identified for insertion into the cache, responsive to the determinations that the object does not fit in the cache and the object is unpopular.3. The method of claim 1 , wherein the priority of the object and the priorities of the one or more objects in the set of ...

Подробнее
Номер записи: 24
28-07-2011 дата публикации

JOIN ALGORITHMS OVER FULL TEXT INDEXES

Номер: US20110184933A1
Автор: Latha Sankar Colby, Quanzhong Li, Fatma Ozcan, Mir Hamid Pirahesh, Eugene J. Shekita, Zografoula Vagena, COLBY LATHA SANKAR, LI QUANZHONG, OZCAN FATMA, PIRAHESH MIR HAMID, SHEKITA EUGENE J, VAGENA ZOGRAFOULA, SHEKITA EUGENE J.
Принадлежит: International Business Machines Corporation

According to one embodiment of the present invention, a method for processing join predicates in full-text indexes is provided. The method includes evaluating local predicates of an outer full text index to generate a first posting list of documents. For each document in the first posting list, the value of a join attribute is determined and an inner full text index is probed to obtain a second posting list of documents containing one of the join attributes determined for each document. Local predicates of an inner full text index are evaluated to generate a third posting list of documents, and the second posting list is merged with the third posting list to generate a merge list of documents. Documents in the first posting list may be paired up with documents in the merge list.

Подробнее
Номер записи: 25
08-04-2021 дата публикации

ONTOLOGY-BASED DATA STORAGE FOR DISTRIBUTED KNOWLEDGE BASES

Номер: US20210103827A1
Автор: ABDUL QUAMAR, FATMA OZCAN, RANA ALOTAIBI, Chuan Lei, QUAMAR ABDUL, OZCAN FATMA, ALOTAIBI RANA, LEI CHUAN, QUAMAR, ABDUL, OZCAN, FATMA, ALOTAIBI, RANA, Lei, Chuan
Принадлежит:

Techniques for distributed data placement are provided. Query workload information corresponding to a domain is determined by a data orchestrator, and the query workload information is modeled as a hypergraph, where the hypergraph includes a set of vertices and a set of hyperedges, where each vertex in the set of vertices corresponds to a concept in an ontology associated with the domain. Mappings are generated between concepts and a plurality of data nodes based on the hypergraph and based further on predefined capability of each of the plurality of data nodes. A distributed knowledge base is established based on the generated mappings. 1. A method , comprising:determining, by a data orchestrator, query workload information corresponding to a domain;modeling the query workload information as a hypergraph, wherein the hypergraph includes a set of vertices and a set of hyperedges, wherein each vertex in the set of vertices corresponds to a concept in an ontology associated with the domain;generating mappings between concepts and a plurality of data nodes based on the hypergraph and based further on predefined capability of each of the plurality of data nodes; andestablishing a distributed knowledge base based on the generated mappings.2. The method of claim 1 , wherein determining the query workload information comprises:receiving a set of prior ontological queries;generating a first set of concepts accessed by a first query in the set of prior ontological queries;generating a second set operations performed by the first query; and identifying a group of queries, from the set of prior ontological queries, with corresponding matching first sets;', 'determining, based on corresponding second sets for each query in the identified group of queries, an aggregate set of operations; and', 'associating the first summarized query with the aggregate set of operations and concepts reflected in the corresponding matching first sets., 'generating a first summarized query by3. The ...

Подробнее
Номер записи: 26
05-05-2005 дата публикации

XPath containment for index and materialized view matching

Номер: US2005097084A1
Автор: BALMIN ANDREY L, BEYER KEVIN S, COCHRANE ROBERTA J, OZCAN FATMA, PIRAHESH MIR H, BALMIN ANDREY L., BEYER KEVIN S., COCHRANE ROBERTA J., PIRAHESH MIR H.
Принадлежит:

A method for using pre-computed information stored in auxiliary structures to speed up processing of expensive queries on hierarchical documents such as XML documents being queried using XPath. The invention defines a taxonomy of such structures such as indexes and materialized views for storing pre-computed XPath results (PXRs), determines what portion of the query can be evaluated by the structures, and computes the compensation for the results generated by the structures. The invention detects all structures applicable to the query and rewrites the query to use such structures, speeding up the performance of the queries. The invention identifies the matching structures by detecting containment mappings between XPath expressions in the query and the structure. The invention also includes a new representation for XPath expressions that is rich enough to express all features of XPath.

Подробнее
Номер записи: 27
12-10-2021 дата публикации

Assignment of data within file systems

Номер: US0011144500B2
Автор: Uttam Jain, Nimrod Megiddo, Umar F. Minhas, Fatma Ozcan, Robbert Van Der Linden, JAIN UTTAM, MEGIDDO NIMROD, MINHAS UMAR F, OZCAN FATMA, VAN DER LINDEN ROBBERT, Jain, Uttam, Megiddo, Nimrod, Minhas, Umar F., Ozcan, Fatma, Van Der Linden, Robbert
Принадлежит: International Business Machines Corporation, IBM

The embodiments relate to assigning data to processors of a file system. Metadata associated with respective blocks of data, and an initial batch of the blocks is assigned to nodes of a file system based on the metadata. Unassigned blocks are selectively assigned to one or more of the nodes. The selective assignment includes constructing a linear regression model based on node data, and determining a value for each node based on the linear regression model. Each value is associated with a predicted load corresponding to a new assignment of one or more unassigned blocks.

Подробнее
Номер записи: 28
06-03-2018 дата публикации

Split elimination in MapReduce systems

Номер: US0009910860B2
Автор: Mohamed Eltabakh, Peter J. Haas, Fatma Ozcan, Mir Hamid Pirahesh, John (Yannis) Sismanis, Jan Vondrak, ELTABAKH MOHAMED, HAAS PETER J, OZCAN FATMA, PIRAHESH MIR HAMID, SISMANIS JOHN YANNIS, VONDRAK JAN, Eltabakh Mohamed, Haas Peter J., Ozcan Fatma, Pirahesh Mir Hamid, Sismanis John (Yannis), Vondrak Jan
Принадлежит: INTERNATIONAL BUSINESS MACHINES CORPORATION, IBM

Embodiments of the present invention relate to elimination of blocks such as splits in distributed processing systems such as MapReduce systems using the Hadoop Distributed Filing System (HDFS). In one embodiment, a method of and computer program product for optimizing queries in distributed processing systems are provided. A query is received. The query includes at least one predicate. The query refers to data. The data includes a plurality of records. Each record comprises a plurality of values in a plurality of attributes. Each record is located in at least one of a plurality of blocks of a distributed file system. Each block has a unique identifier. For each block of the distributed file system, at least one value cluster is determined for an attribute of the plurality of attributes. Each value cluster has a range. The predicate of the query is compared with the at least one value cluster of each block. The query is executed against only those blocks where the predicate is met by at least one value cluster.

Подробнее
Номер записи: 29
08-04-2021 дата публикации

ONTOLOGY-BASED QUERY ROUTING FOR DISTRIBUTED KNOWLEDGE BASES

Номер: US20210103586A1
Автор: ABDUL QUAMAR, FATMA OZCAN, RANA ALOTAIBI, QUAMAR ABDUL, OZCAN FATMA, ALOTAIBI RANA, QUAMAR, ABDUL, OZCAN, FATMA, ALOTAIBI, RANA
Принадлежит:

Techniques for query routing are provided. An ontological query is received by a query orchestrator. One or more query blocks, each indicating one or more operations and one or more quantifiers representing data flow between query blocks, are generated based on the ontological query. At least one data node is identified for each of the one or more query blocks, based on the one or more quantifiers and the one or more operations. One or more of the identified data nodes are selected based on predefined cost criteria, and one or more subqueries are transmitted to the selected one or more data nodes. 1. A method , comprising:receiving, by a query orchestrator, an ontological query;generating, based on the ontological query, one or more query blocks, each indicating one or more operations and one or more quantifiers representing data flow between query blocks;identifying, for each of the one or more query blocks, at least one data node based on the one or more quantifiers and the one or more operations;selecting one or more of the identified data nodes based on predefined cost criteria; andtransmitting one or more subqueries to the selected one or more data nodes.2. The method of claim 1 , wherein identifying claim 1 , for a first query block of the one or more query blocks claim 1 , at least one data node comprises:identifying, based on predefined capability criteria, a first set of data nodes configured to perform the one or more operations indicated by the first query block; andidentifying, based on predefined concept mappings, a second set of data nodes configured to store the one or more quantifiers indicated by the first query block.3. The method of claim 2 , the method further comprising:upon determining that a first data node belongs to both the first set and the second set of data nodes, associating the first query block with an annotation indicating the first data node.4. The method of claim 2 , the method further comprising: identifying a first data node that ...

Подробнее
Номер записи: 30
25-02-2014 дата публикации

Join algorithms over full text indexes

Номер: US0008661019B2
Автор: Latha Sankar Colby, Quanzhong Li, Fatma Ozcan, Mir Hamid Pirahesh, Eugene J. Shekita, Zografoula Vagena, COLBY LATHA SANKAR, LI QUANZHONG, OZCAN FATMA, PIRAHESH MIR HAMID, SHEKITA EUGENE J, VAGENA ZOGRAFOULA, SHEKITA EUGENE J.
Принадлежит: International Business Machines Corporation, COLBY LATHA SANKAR, LI QUANZHONG, OZCAN FATMA, PIRAHESH MIR HAMID, SHEKITA EUGENE J, VAGENA ZOGRAFOULA, IBM, SHEKITA EUGENE J., INTERNATIONAL BUSINESS MACHINES CORPORATION

According to one embodiment of the present invention, a method for processing join predicates in full-text indexes is provided. The method includes evaluating local predicates of an outer full text index to generate a first posting list of documents. For each document in the first posting list, the value of a join attribute is determined and an inner full text index is probed to obtain a second posting list of documents containing one of the join attributes determined for each document. Local predicates of an inner full text index are evaluated to generate a third posting list of documents, and the second posting list is merged with the third posting list to generate a merge list of documents. Documents in the first posting list may be paired up with documents in the merge list.

Подробнее
Номер записи: 31
14-07-2016 дата публикации

PARALLEL DATA STREAMING BETWEEN CLOUD-BASED APPLICATIONS AND MASSIVELY PARALLEL SYSTEMS

Номер: US20160205188A1
Автор: Sangeeta T. Doraiswamy, Marc Hörsken, Fatma Ozcan, Mir H. Pirahesh, DORAISWAMY SANGEETA T, HÖRSKEN MARC, OZCAN FATMA, PIRAHESH MIR H, DORAISWAMY SANGEETA T., PIRAHESH MIR H.
Принадлежит:

Embodiments relate to parallel data streaming between a first computer system and a second computer system. Aspects include transmitting a request to establish an authenticated connection between a processing job on the first computer system and a process on the second computer system and transmitting a query to the process on the second computer system over the authenticated connection. Aspects further include creating one or more tasks on the first computer system configured to receive data from the second computer system in parallel and reading data received by the one or more tasks by the processing job on the first computer system. 1. A method for parallel data streaming from a second computer system to a first computer system comprising:transmitting a request to establish an authenticated connection between a processing job on the first computer system and a process on the second computer system;transmitting a query to the process on the second computer system over the authenticated connection;creating one or more tasks on the first computer system configured to receive data from the second computer system in parallel; andreading data received by the one or more tasks by the processing job on the first computer system.2. The method of claim 1 , wherein establishing the authenticated connection comprises exchanging credential information claim 1 , user-data claim 1 , entitlement rules and certification data between the first computer system and the second computer system.3. The method of claim 1 , wherein the query comprises a query information and a communication information.4. The method of claim 3 , wherein the communication information includes a number of port numbers that are each associated with one of the one or more tasks on the first computer system.5. The method of claim 3 , wherein the number of ports comprises a number of read ports and a number of write ports claim 3 , wherein the write ports are used by the first computer system to write data to ...

Подробнее
Номер записи: 32
18-01-2018 дата публикации

TRANSFORMING AN ONTOLOGY QUERY TO AN SQL QUERY

Номер: US20180018329A1
Автор: Floratou Avrilia, OZCAN FATMA
Принадлежит:

A computer-implemented method according to one embodiment includes receiving an ontology language query, receiving a mapping of an ontology to a relational database, and generating a structured query language (SQL) query, utilizing the ontology language query and the mapping of the ontology to the relational database. 1. A computer-implemented method , comprising:receiving an ontology language query;receiving a mapping of an ontology to a relational database; andgenerating a structured query language (SQL) query, utilizing the ontology language query and the mapping of the ontology to the relational database.2. The computer-implemented method of claim 1 , wherein the ontology includes a set of concepts claim 1 , a set of relations claim 1 , and a set of properties.3. The computer-implemented method of claim 1 , wherein the mapping includes one of a plurality of mapping functions that perform mapping between the ontology and the relational database.4. The computer-implemented method of claim 1 , wherein the mapping describes how elements of the ontology are mapped to objects stored in the relational database.5. The computer-implemented method of claim 1 , wherein generating the SQL query includes claim 1 , when it is determined that the ontology language query includes an attribute having a NULL value claim 1 , assigning a virtual type to the attribute and attempting to retrieve a value for the attribute from a parent concept in the ontology.6. The computer-implemented method of claim 1 , wherein generating the SQL query includes determining a type of attributes and join conditions within the ontology language query.7. The computer-implemented method of claim 1 , wherein generating the SQL query includes directly translating the ontology language query into the SQL query when it is determined that the ontology language query includes only attributes and join conditions of a concrete type.8. The computer-implemented method of claim 1 , wherein generating the SQL query ...

Подробнее
Номер записи: 33
14-04-2016 дата публикации

JOINING DATA ACROSS A PARALLEL DATABASE AND A DISTRIBUTED PROCESSING SYSTEM

Номер: US20160103877A1
Автор: OZCAN FATMA, Pirahesh Hamid, Tian Yuanyuan, Zou Tao
Принадлежит:

Embodiments relate to joining data across a parallel database and a distributed processing system. Aspects include receiving a query on data stored in parallel database T and data stored in distributed processing system L, applying local query predicates and projection to data T to create T′, and applying local query predicates and projection to L to create L′. Based on determining that a size of L′ is less than a size of T′ and that the size of L′ is less than a first threshold, transmitting L′ to the parallel database and executing a join between T′ and L′. Based on determining that a number of the nodes distributed processing system n multiplied by the size of T′ is less than the size of L′ and that the size of T′ is less than a second threshold; transmitting T′ to the distributed processing system and executing a join between T′ and L′. 1. A method for joining data across a parallel database and a distributed processing system comprising:receiving a query on data stored in the parallel database T and data stored in the distributed processing system L;{'sub': 'T', 'applying local projection and one or more local predicates σbased on the query to data stored on the parallel database T to create a filtered data T′;'}{'sub': 'L', 'applying local projection and one or more local predicates σbased on the query to data stored on the distributed processing system L to create a filtered data L′;'}based on determining that a size of L′ is less than a size of T′ and that the size of L′ is less than a parallel database broadcast threshold, one or more of the nodes of distributed processing system transmitting L′ to the parallel database, and in response to receiving L′, one or more nodes of the parallel database executing a join between T′ and L′; andbased on determining that a number of the nodes of distributed processing system n multiplied by the size of T′ is less than the size of L′ and that the size of T′ is less than a distributed files system transfer threshold; one ...

Подробнее
Номер записи: 34
01-09-2022 дата публикации

GUIDED EXPLORATION FOR CONVERSATIONAL BUSINESS INTELLIGENCE

Номер: US20220277031A1
Автор: EFTHYMIOU VASILIS, Lei Chuan, MEDURI Venkata Vamsikrishna, OZCAN FATMA, QUAMAR ABDUL
Принадлежит:

A computing device and computer-implemented method to provide access to business intelligence data via a conversational interface is described. The method begins with receiving prior user interactions based on corresponding pairs of user queries and computing device responses, with the conversational interface. Received also is a business intelligence ontology and access to a conversational space structure for the conversational interface. The computing device executes a machine learning model based upon the prior user interactions, business intelligence ontology, and the conversational space structure to predict possible next queries. The possible next queries are sent to a user. In one example, the computing device receives a user query, which is in addition to the prior user interactions with the conversational interface. A response to the query is generated. The response to the query is sent to the user prior to sending the possible next queries, which have been predicted. 1. A computer-implemented method of using a computing device to provide access to business intelligence data via a conversational interface , the method comprising:receiving, by a computing device, a plurality of prior user interactions based on corresponding pairs of user queries and computing device responses, with a conversational interface;receiving, by the computing device, a business intelligence (BI) ontology;receiving, by the computing device, access to a conversational space structure for the conversational interface;executing, by the computing device, a machine learning model based upon the plurality of prior user interactions, business intelligence ontology, and the conversational space structure to predict one or more possible next queries; andsending to the user, by the computing device, the one or more possible next queries which have been predicted.2. The computer-implemented method of claim 1 , further comprising:receiving, by the computing device, a user query, that is in ...

Подробнее
Номер записи: 35
12-07-2018 дата публикации

SPLIT ELIMINATION IN MAPREDUCE SYSTEMS

Номер: US20180196828A1
Автор: Eltabakh Mohamed, Haas Peter J., OZCAN FATMA, Pirahesh Mir Hamid, Sismanis John (Yannis), Vondrak Jan
Принадлежит:

Embodiments of the present invention relate to elimination of blocks such as splits in distributed processing systems such as MapReduce systems using the Hadoop Distributed Filing System (HDFS). In one embodiment, a method of and computer program product for optimizing queries in distributed processing systems are provided. A query is received. The query includes at least one predicate. The query refers to data. The data includes a plurality of records. Each record comprises a plurality of values in a plurality of attributes. Each record is located in at least one of a plurality of blocks of a distributed file system. Each block has a unique identifier. For each block of the distributed file system, at least one value cluster is determined for an attribute of the plurality of attributes. Each value cluster has a range. The predicate of the query is compared with the at least one value cluster of each block. The query is executed against only those blocks where the predicate is met by at least one value cluster. 1. A method comprising:receiving a query comprising at least one predicate, the query referring to data comprising a plurality of records, each record comprising a plurality of values in a plurality of attributes and each record being located in at least one of a plurality of blocks of a distributed file system, each block having a unique identifier;determining a block count indicating the number of blocks in which each of the values of the data appear;determining a record count indicating the number of instances of each of the values in each of the attributes;based on the block count, determining a profit value associated with copying each of the values of the data to a materialized view;based on the record count, determining a cost value associated with copying each of the values of the data to a materialized view;selecting a predetermined number of values such that the profit to cost ratio is maximal for the predetermined number of values;providing a ...

Подробнее
Номер записи: 36
06-08-2015 дата публикации

SPLIT ELIMINATION IN MAPREDUCE SYSTEMS

Номер: US20150220529A1
Автор: Eltabakh Mohamed, Haas Peter J., OZCAN FATMA, Pirahesh Mir Hamid, Sismanis John (Yannis), Vondrak Jan
Принадлежит: INTERNATIONAL BUSINESS MACHINES CORPORATION

Embodiments of the present invention relate to elimination of blocks such as splits in distributed processing systems such as MapReduce systems using the Hadoop Distributed Filing System (HDFS). In one embodiment, a method of and computer program product for optimizing queries in distributed processing systems are provided. A query is received. The query includes at least one predicate. The query refers to data. The data includes a plurality of records. Each record comprises a plurality of values in a plurality of attributes. Each record is located in at least one of a plurality of blocks of a distributed file system. Each block has a unique identifier. For each block of the distributed file system, at least one value cluster is determined for an attribute of the plurality of attributes. Each value cluster has a range. The predicate of the query is compared with the at least one value cluster of each block. The query is executed against only those blocks where the predicate is met by at least one value cluster. 1. A method comprising:receiving a query comprising at least one predicate, the query referring to data comprising a plurality of records, each record comprising a plurality of values in a plurality of attributes and each record being located in at least one of a plurality of blocks of a distributed file system, each block having a unique identifier;for each block of the distributed file system, determining for an attribute of the plurality of attributes at least one value cluster, each value cluster having a range; andcomparing the predicate of the query with the at least one value cluster of each block, and executing the query against those blocks where the predicate is met by at least one value cluster.2. The method of claim 1 , wherein block comprises a split and the distributed file system is a Hadoop Distributed File System.3. The method of claim 1 , wherein executing the query comprises executing a MapReduce job of a MapReduce system.4. The method of ...

Подробнее
Номер записи: 37
09-08-2018 дата публикации

ACCESSING TABLES WITH HETEROGENEOUS PARTITIONS

Номер: US20180225215A1
Автор: Floratou Avrilia, OZCAN FATMA, Pirahesh Mir H., Potti Navneet S.
Принадлежит:

A computer-implemented method according to one embodiment includes receiving a request for data, locating the data at one or more partitions of a heterogeneously partitioned table, determining an access method associated with each of the one or more partitions, and requesting the data from the one or more partitions, utilizing the access method associated with each of the one or more partitions. 1. A computer-implemented method , comprising:receiving a request for data;locating the data at both a first partition and a second partition of a heterogeneously partitioned table;determining a first access method associated with the first partition, based on a description of the first partition;determining a second access method associated with the second partition, based on a description of the second partition, where the second access method is different from the first access method; andrequesting the data from the first partition and the second partition, utilizing the first access method and the second access method.2. The computer-implemented method of claim 1 , wherein the data is stored in a combination of storage mediums and object-stores.3. The computer-implemented method of claim 1 , wherein:the description of the first partition includes a location of the first partition, a type of hardware of the first partition, a storage format used by the first partition, and a data type used by the first partition, and the description of the second partition includes a location of the second partition, a type of hardware of the second partition, a storage format used by the second partition, and a data type used by the second partition.4. The computer-implemented method of claim 1 , wherein the first partition represents a first storage location and the second partition represents a second storage location different from the first storage location claim 1 , and the first storage location has a different storage format than the second storage location.5. The computer- ...

Подробнее
Номер записи: 38
26-08-2021 дата публикации

REDUCING RESPONSE TIME FOR QUERIES DIRECTED TO DOMAIN-SPECIFIC KNOWLEDGE GRAPH USING PROPERTY GRAPH SCHEMA OPTIMIZATION

Номер: US20210263898A1
Автор: ALOTAIBI RANA, EFTHYMIOU VASILIS, Lei Chuan, OZCAN FATMA, QUAMAR ABDUL
Принадлежит:

According to one or more embodiments of the present invention, a computer-implemented method for providing a query response includes receiving, by a computing device, a domain-specific knowledge graph. The method further includes generating a first property graph schema, a property graph schema includes vertices, edges, and properties of the domain-specific knowledge graph, wherein the first property graph schema is generated based on an ontology of the domain-specific knowledge graph. The method further includes generating a second property graph schema from a copy of the first property graph schema that is optimized by applying one or more types of relationships in the first property graph schema. The method further includes instantiating a property graph using the second property graph schema. The method further includes receiving a query to obtain particular data from the domain-specific knowledge graph. The method further includes responding to the query using the property graph. 1. A computer-implemented method for providing a query response , the computer-implemented method comprising:receiving, by a computing device, a domain-specific knowledge graph;generating, by the computing device, a first property graph schema, a property graph schema includes vertices, edges, and properties of the domain-specific knowledge graph, wherein the first property graph schema is generated based on an ontology of the domain-specific knowledge graph;generating, by the computing device, a second property graph schema from a copy of the first property graph schema that is optimized by applying one or more types of relationships in the first property graph schema;instantiating, by the computing device, a property graph using the second property graph schema;receiving, by the computing device, a query to obtain particular data from the domain-specific knowledge graph; andresponding to the query using the property graph.2. The computer-implemented method of further comprising claim ...

Подробнее
Номер записи: 39
29-10-2015 дата публикации

ADAPTIVE FRAGMENT ASSIGNMENT FOR PROCESSING FILE DATA IN A DATABASE

Номер: US20150310030A1
Автор: Balmin Andrey, Goncalves Romulo Antonio Pereira, OZCAN FATMA, Traub Jonas
Принадлежит: INTERNATIONAL BUSINESS MACHINES CORPORATION

Scheduling mechanisms for assigning data in a distributed file system to database workers are provided. In one embodiment, a method of and computer program product for assignment of data blocks to database workers are provided. A request for table data is received. Metadata for a plurality of blocks in a file system is retrieved from a metadata store. Each of the plurality of blocks contains a subset of the table data. A request for work is received from a requestor. An assignment of one or more of the plurality of blocks is provided to the requestor. 1. A method comprising:storing, in a metadata store, metadata of a plurality of blocks of a file system;executing a process requiring data from at least one of the blocks of the file system;acquiring exclusive access to the at least one of the blocks;providing data from the at least one of the blocks to the process based on the metadata of the plurality of blocks.2. The method of claim 1 , wherein the file system is selected from the group consisting of a distributed file system and a shared file system.3. The method of claim 1 , wherein the metadata store is a distributed metadata store.4. The method of claim 3 , wherein the metadata store is ZooKeeper.5. The method of claim 1 , wherein the file system is HDFS and the blocks are splits.6. The method of claim 1 , wherein the file system comprises a plurality of splits claim 1 , and each of the plurality of splits comprises a plurality of the blocks of the file system.7. The method of claim 1 , wherein acquiring exclusive access comprises registering a lock in the metadata store.8. The method of claim 1 , further comprising:merging output of the process with output of an additional process to provide a result table.9. A method comprising:receiving a request for table data;retrieving metadata for a plurality of blocks in a file system from a metadata store, each of the plurality of blocks containing a subset of the table data;receiving a request for work from a requestor ...

Подробнее
Номер записи: 40
17-12-2015 дата публикации

DYNAMIC QUERY OPTIMIZATION WITH PILOT RUNS

Номер: US20150363466A1
Автор: Balmin Andrey, Ercegovac Vuk, Jackson Jesse E., KARANASOS Konstantinos, Kutsch Marcel, OZCAN FATMA, Xia Chunyang
Принадлежит:

In one embodiment, a computer-implemented method includes selecting one or more sub-expressions of a query during compile time. One or more pilot runs are performed by one or more computer processors. The one or more pilot runs include a pilot run associated with each of one or more of the selected sub-expressions, and each pilot run includes at least partial execution of the associated selected sub-expression. The pilot runs are performed during execution time. Statistics are collected on the one or more pilot runs during performance of the one or more pilot runs. The query is optimized based at least in part on the statistics collected during the one or more pilot runs, where the optimization includes basing cardinality and cost estimates on the statistics collected during the pilot runs. 1. A computer-implemented method , comprising:selecting one or more sub-expressions of a query during compile time;performing, by one or more computer processors, one or more pilot runs, comprising a pilot run associated with each of one or more of the selected sub-expressions, wherein each pilot run comprises at least partial execution of the associated selected sub-expression, and wherein the pilot runs are performed during execution time;collecting statistics on the one or more pilot runs during performance of the one or more pilot runs; andoptimizing the query based at least in part on the statistics collected during the one or more pilot runs, wherein the optimization comprises basing cardinality and cost estimates on the statistics collected during the pilot runs.2. The method of claim 1 , wherein performing the one or more pilot runs comprises performing two or more pilot runs in parallel across two or more processors.3. The method of claim 1 , further comprising storing claim 1 , in a database metastore claim 1 , the statistics collected during the one or more pilot runs claim 1 , wherein the statistics collected during a first pilot run associated with a first selected ...

Подробнее
Номер записи: 41
12-12-2023 дата публикации

Query relaxation using external domain knowledge for query answering

Номер: US11841867B2
Автор: Chuan Lei, Dorian Boris Miller, Fatma Ozcan, Jeffrey Kreulen, Rebecca Geis
Принадлежит: International Business Machines Corp

A system, method, and computer readable medium perform a method of query relaxation. A query output from a conversational system is received. At least one search term in the query is identified. Instance data is output to the conversational system in response to determining that the instance data in a data store matches the at least one search term in the query. The computer device outputs the received query to an external domain-specific knowledge source in response to determining that the at least one search term does not the match instance data in the data store. The computer device receives the relaxed data matches from the external domain-specific knowledge source being semantically-related to at least one search term in the query based on a plurality of criteria associated with the query. The computing device generates a response to the query based on contextual information and structural information.

Подробнее
Номер записи: 42
28-07-2022 дата публикации

Hybrid graph neural network

Номер: US20220237447A1
Автор: Abdul Quamar, Chuan Lei, Fatma Ozcan, Junheng Hao, Vasilis Efthymiou
Принадлежит: International Business Machines Corp

An embodiment includes extracting, responsive to an update request from a remote requesting system, technical descriptor data from a data source. The embodiment also includes forming a new graph data structure using the technical descriptor data extracted from the data source. The embodiment also includes augmenting the new graph data structure to include a concept based on a value from instance data from the data source. The embodiment also includes identifying a first pair of concepts that are connected in a pre-existing ontology that correspond with a second pair of concepts that lack a connection therebetween in the new graph structure. The embodiment also includes augmenting the new graph data structure to include a connection between the second pair of concepts. The embodiment also includes outputting the new graph data structure as part of a response to the update request from the requesting system.

Подробнее
Номер записи: 43
15-06-2022 дата публикации

Query relaxation using external domain knowledge for query answering

Номер: GB2601936A
Автор: Boris Millar Dorian, Geis Rebecca, Kreulen Jeffrey, Lei Chuan, OZCAN FATMA
Принадлежит: International Business Machines Corp

A system, method, and computer readable medium perform a method of query relaxation. A query output from a conversational system is received. At least one search term in the query is identified. Instance data is output to the conversational system in response to determining that the instance data in a data store matches the at least one search term in the query. The computer device outputs the received query to an external domain-specific knowledge source in response to determining that the at least one search term does not the match instance data in the data store. The computer device receives the relaxed data matches from the external domain-specific knowledge source being semantically-related to at least one search term in the query based on a plurality of criteria associated with the query. The computing device generates a response to the query based on contextual information and structural information.

Подробнее
Номер записи: 44
24-03-2022 дата публикации

Abfrage-relaxation unter verwendung externen domänenwissenes zur beantwortung von abfragen

Номер: DE112020003141T5
Автор: Chuan Lei, Dorian Boris Miller, Fatma Ozcan, Jeffrey Kreulen, Rebecca Geis
Принадлежит: International Business Machines Corp

Ein System, ein Verfahren und ein computerlesbares Medium führen ein Verfahren zur Abfrage-Relaxation aus. Eine Abfrage, die von einem Konversationssystem ausgegeben wird, wird empfangen. Mindestens ein Suchbegriff in der Abfrage wird ermittelt. Instanzdaten werden an das Konversationssystem in Reaktion auf die Ermittlung ausgegeben, dass die Instanzdaten in einem Datenspeicher mit dem mindestens einen Suchbegriff in der Abfrage übereinstimmen. Das Computergerät gibt die empfangene Abfrage in Reaktion auf die Ermittlung, dass der mindestens eine Suchbegriff nicht mit den Instanzdaten im Datenspeicher übereinstimmt, an eine externe domänenspezifische Wissensquelle aus. Das Computergerät empfängt die relaxierten Datenübereinstimmungen von der externen domänenspezifischen Wissensquelle, die auf Grundlage einer Mehrzahl von mit der Abfrage verknüpften Kriterien mit mindestens einem Suchbegriff in der Abfrage semantisch verwandt sind. Das Computergerät erzeugt eine Rückmeldung auf die Abfrage basierend auf kontextueller Information und struktureller Information.

Подробнее
Номер записи: 45
22-02-2024 дата публикации

Query Relaxation using External Domain Knowledge for Query Answering

Номер: US20240061850A1
Автор: Chuan Lei, Dorian Boris Miller, Fatma Ozcan, Jeffrey Kreulen, Rebecca Geis
Принадлежит: International Business Machines Corp

An offline adaptation method of customizing and incorporating external knowledge domain specific knowledge sources into an existing knowledge base (KB) of a cognitive conversation system, includes obtaining an instance-concept frequency from the existing KB. All the contexts of a domain ontology in which an instance-concept is used are computed. All instance-concepts from the existing KB to an external domain-specific knowledge source are mapped. The existing KB is configured to search for semantically related terms in response to a natural language query received from a conversation system.

Подробнее
Номер записи: 46
15-04-2021 дата публикации

Ontology-based query routing for distributed knowledge bases

Номер: WO2021070012A1
Автор: Abdul Quamar, Fatma Ozcan, Rana Alotaibi
Принадлежит: Ibm (China) Investment Company Limited, Ibm United Kingdom Limited, INTERNATIONAL BUSINESS MACHINES CORPORATION

Techniques for query routing are provided. An ontological query is received by a query orchestrator. One or more query blocks, each indicating one or more operations and one or more quantifiers representing data flow between query blocks, are generated based on the ontological query. At least one data node is identified for each of the one or more query blocks, based on the one or more quantifiers and the one or more operations. One or more of the identified data nodes are selected based on predefined cost criteria, and one or more subqueries are transmitted to the selected one or more data nodes.

Подробнее
Номер записи: 47
21-06-2021 дата публикации

Nakli̇ye araçlari ve soğuk hava depolarinda ürün dezenfeksi̇yon yöntemi̇

Номер: TR202105140A2
Автор: OZCAN FATMA
Принадлежит: Bambu Multiplex Tarim Fumigasyon Ithalat Ihracat Sanayi Ve Ticaret Ltd Sirketi

Buluş, tır dorsesi ve konteyner gibi nakliye araçları ve soğuk hava depoları olan soğutma sistemine (20) sahip soğutmalı kabinlerinde (10) depolanarak muhafaza edilen veya taşınan yaş sebze veya meyve içeren paletli ürünlere (100) uygulanarak paletli ürünler (100) üzerindeki pestisit kalıntılarının parçalanmasını, virüs, bakteri ve küf gibi mikroorganizmaların etkisiz hale getirilmesini ve raf ömrünün uzatılmasını sağlayan dezenfeksiyon yöntemi ile ilgilidir.

Подробнее
Номер записи: 48
25-06-2024 дата публикации

Ontology-driven conversational interface for data analysis

Номер: US12019995B2
Автор: Abdul Quamar, Dorian Boris Miller, Fatma Ozcan, Jeffrey Thomas Kreulen, Robert John Moore
Принадлежит: International Business Machines Corp

A computer-implemented method for generating an ontology-driven conversational interface includes generating an ontology from a description of a domain schema of a Data Analysis (DA) model, in which the DA model is a defined in terms of quantifiable, qualifying or categorical entities and their relationships as described by the domain schema. Conversational artifacts of a conversation space including a conversational pattern framework are generated by extracting DA-related intents, entities, and a dialog from the generated ontology for the conversational interface. A dialog logic table maps DA-related patterns to intents, extracted quantifiable, qualifying or categorical attributes to entities, and the dialog to user-prompts for one or more parameters in an identified DA pattern. The conversation space is integrated with at least one of an external data source or an analytics platform that stores and processes data.

Подробнее
Номер записи: 49
23-06-2022 дата публикации

Ontologiegestützte abfrageweiterleitung für verteilte wissensdatenbanken

Номер: DE112020004814T5
Автор: Abdul Quamar, Fatma Ozcan, Rana Alotaibi
Принадлежит: International Business Machines Corp

Techniken zum Weiterleiten von Abfragen werden bereitgestellt. Eine ontologische Abfrage wird von einem Abfrageorchestrator empfangen. Ein oder mehrere Abfrageblöcke, von denen jeder eine oder mehrere Operationen und einen oder mehrere Quantoren angeben, die einen Datenfluss zwischen Abfrageblöcken darstellen, werden auf der Grundlage der ontologischen Abfrage erzeugt. Mindestens ein Datenknoten wird für jeden des einen oder mehrerer Abfrageblöcke auf der Grundlage des einen oder mehrerer Quantoren und der einen oder mehrerer Operationen identifiziert. Ein oder mehrere der identifizierten Datenknoten werden auf der Grundlage vordefinierter Kostenkriterien ausgewählt, und eine oder mehrere Teilabfragen werden an den ausgewählten einen oder an die ausgewählten mehreren Datenknoten übertragen.

Подробнее
Номер записи: 50
14-07-2016 дата публикации

Parallel data streaming between cloud-based applications and massively parallel systems

Номер: WO2016110461A1
Автор: Fatma Ozcan, Marc HOERSKEN, Mir Hamid Pirahesh, Sangeeta Doraiswamy
Принадлежит: Ibm United Kingdom Limited, INTERNATIONAL BUSINESS MACHINES CORPORATION

A method for parallel data streaming between a first computer system and a second computer system includes transmitting a request to establish an authenticated connection between a processing job on the first computer system and a process on the second computer system and transmitting a query to the process on the second computer system over the authenticated connection. One or more tasks are created on the first computer system configured to receive data from the second computer system in parallel and data is received by the one or more tasks by the processing job on the first computer system.

Подробнее
Номер записи: 51
15-06-2022 дата публикации

Ontologiegestützter datenspeicher für verteilte wissensdatenbanken

Номер: DE112020004815T5
Автор: Abdul Quamar, Chuan Lei, Fatma Ozcan, Rana Alotaibi
Принадлежит: International Business Machines Corp

Techniken für eine verteilte Datenplatzierung werden bereitgestellt. Abfragearbeitslast-Informationen, die einer Domäne entsprechen, werden von einem Datenorchestrator ermittelt, und die Abfragearbeitslast-Informationen werden als ein Hypergraph modelliert, wobei der Hypergraph einen Satz von Eckpunkten und einen Satz von Hyperkanten umfasst, wobei jeder Eckpunkt in dem Satz von Eckpunkten einem Konzept in einer der Domäne zugehörigen Ontologie entspricht. Zuordnungen zwischen Konzepten und einer Mehrzahl von Datenknoten auf der Grundlage des Hypergraphen und weiterhin auf der Grundlage vordefinierter Fähigkeiten jedes der Mehrzahl von Datenknoten werden erzeugt. Eine verteilte Wissensdatenbank wird auf der Grundlage der erzeugten Zuordnungen eingerichtet.

Подробнее
Номер записи: 52
15-04-2021 дата публикации

Ontology-based data storage for distributed knowledge bases

Номер: WO2021070013A1
Автор: Abdul Quamar, Chuan Lei, Fatma Ozcan, Rana Alotaibi
Принадлежит: Ibm (China) Investment Company Limited, Ibm United Kingdom Limited, INTERNATIONAL BUSINESS MACHINES CORPORATION

Techniques for distributed data placement are provided. Query workload information corresponding to a domain is determined by a data orchestrator, and the query workload information is modeled as a hypergraph, where the hypergraph includes a set of vertices and a set of hyperedges, where each vertex in the set of vertices corresponds to a concept in an ontology associated with the domain. Mappings are generated between concepts and a plurality of data nodes based on the hypergraph and based further on predefined capability of each of the plurality of data nodes. A distributed knowledge base is established based on the generated mappings.

Подробнее
Номер записи: 53
04-09-2018 дата публикации

Caching policies for selection and replacement of objects

Номер: US10067885B2
Автор: Avrilia Floratou, Fatma Ozcan, Navneet S. Potti, Nimrod Megiddo, Uday B. Kale
Принадлежит: International Business Machines Corp

In one embodiment, a computer-implemented method includes inserting a set of accessed objects into a cache, where the set of accessed objects varies in size. An object includes a set of object components, and responsive to receiving a request to access the object, it is determined that the object does not fit into the cache given the set of accessed objects and a total size of the cache. A heuristic algorithm is applied, by a computer processor, to identify in the set of object components one or more object components for insertion into the cache. The heuristic algorithm considers at least a priority of the object compared to priorities of one or more objects in the set of accessed objects. The one or more object components are inserted into the cache.

Подробнее
Номер записи: 54