Rada Yuryevna Chirkova
Is this your profile?
Claim your Citation Index profile in order to display more information about you and gain access to Libraries services. Just create or connect your ORCID iD.
Create or connect your ORCID iD
Works (45)
Updated: April 5th, 2024 03:23
2023 journal article
Acoustic correlates of prominence in Kala Lizu (Tibeto-Burman)
JOURNAL OF CHINESE LINGUISTICS, 51(1), 101–146.
author keywords: Prosodic; prominence; Stress; Tone; Lizu; Tibeto-Burman
open access via hal.science (repository)
Source: Web Of Science
Added: April 11, 2023
2023 journal article
Theory and Practice of Relational-to-RDF Temporal Data Exchange and Query Answering
ACM JOURNAL OF DATA AND INFORMATION QUALITY, 15(2).
author keywords: Data-intensive sciences and databases; theory of temporal databases; information quality in temporal data exchange; RDF / RDFS / SPARQL
TL;DR:
A general framework that formalizes the relational-to-RDF temporal data-exchange problem and proves correctness of the information output by the algorithms is developed and also reports on the algorithm implementation and experimental results for two application domains.
(via Semantic Scholar)
Source: Web Of Science
Added: August 14, 2023
2022 article
Compact Walks: Taming Knowledge-Graph Embeddings With Domain- and Task-Specific Pathways
PROCEEDINGS OF THE 2022 INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA (SIGMOD '22), pp. 458–469.
author keywords: Biomedical knowledge graphs (KGs); KG embeddings; domain- and task-specific regular expressions for creating node neighborhoods
TL;DR:
The findings suggest that the proposed CompactWalks approach has the potential to address the promiscuity and runtime-performance challenges in applying embedding tools to large-scale KGs in real life, in the biomedical domain and possibly beyond.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
3. Good Health and Well-being
(Web of Science)
Source: Web Of Science
Added: September 26, 2022
2022 review
Defining clinical outcome pathways
[Review of ]. DRUG DISCOVERY TODAY, 27(6), 1671–1678.
author keywords: Clinical outcome pathways; Key molecular events; Drug repurposing; Knowledge graphs
MeSH headings : Drug Discovery; Drug Repositioning; Knowledge; Knowledge Bases
TL;DR:
It is proposed that broader use of COP uncovered with the help of biomedical knowledge graph mining will likely accelerate drug discovery and repurposing efforts.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
3. Good Health and Well-being
(Web of Science)
Source: Web Of Science
Added: June 27, 2022
2021 journal article
COVID-19 Knowledge Extractor (COKE): A Curated Repository of Drug-Target Associations Extracted from the CORD-19 Corpus of Scientific Publications on COVID-19
JOURNAL OF CHEMICAL INFORMATION AND MODELING, 61(12), 5734–5741.
MeSH headings : Antiviral Agents; COVID-19; Drug Repositioning; Humans; Pandemics; Pharmaceutical Preparations; SARS-CoV-2
TL;DR:
The CO VID-19 Knowledge Extractor (COKE), a web application to extract, curate, and annotate essential drug–target relationships from the research literature on COVID-19, can serve as a useful resource for drug repurposing against SARS-CoV-2.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
3. Good Health and Well-being
(Web of Science; OpenAlex)
Source: Web Of Science
Added: February 28, 2022
2021 journal article
Ensuring Data Readiness for Quality Requirements with Help from Procedure Reuse
ACM JOURNAL OF DATA AND INFORMATION QUALITY, 13(3).
author keywords: Data and information quality; data integration in Big Data; data cleaning in Big Data; Big Data quality and analytics; Big Data quality in business process; Big Data quality management processes, frameworks and models
TL;DR:
This research presents a meta-modelling architecture that automates the very labor-intensive and therefore time-heavy and therefore expensive process of manually cataloging and cataloging data in order to assess and improve the quality of data.
(via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: February 21, 2022
2021 article
Explaining Drug-Discovery Hypotheses Using Knowledge-Graph Patterns
2021 IEEE INTERNATIONAL CONFERENCE ON BIG DATA (BIG DATA), pp. 3709–3716.
author keywords: Drug discovery; knowledge discovery; explainable fact checking; link prediction; knowledge graph mining
TL;DR:
A scalable automated approach for generating explanations that are modeled after existing biomedical concepts and supplemented with data-supported evaluation metrics is introduced, based on knowledge-graph patterns, which are readily understood by biomedical experts.
(via Semantic Scholar)
Source: Web Of Science
Added: July 5, 2022
2021 review
Knowledge-based approaches to drug discovery for rare diseases
[Review of ]. DRUG DISCOVERY TODAY, 27(2), 490–502.
author keywords: Informatics; Rare diseases; Drug discovery; Data mining; Knowledge graphs
MeSH headings : Artificial Intelligence; Drug Discovery / methods; Humans; Knowledge Bases; Machine Learning; Rare Diseases / drug therapy
TL;DR:
It is expected that a broader application of knowledge graph mining and artificial intelligence approaches will expedite the discovery of viable drug candidates against both rare and common diseases.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
3. Good Health and Well-being
(Web of Science)
Source: Web Of Science
Added: February 21, 2022
2021 journal article
Original Learning Drug-Disease-Target Embedding (DDTE) from knowledge graphs to inform drug repurposing hypotheses
JOURNAL OF BIOMEDICAL INFORMATICS, 119.
author keywords: Data mining; Graph embedding; Knowledge graph; Drug repurposing
MeSH headings : Algorithms; Drug Repositioning; Humans; Knowledge; Pattern Recognition, Automated; Pharmaceutical Preparations
TL;DR:
A new graph embedding algorithm for embedding drug-disease-target networks to generate novel drug repurposing hypotheses showed excellent performance, and the predicted drug-Disease and drug-side-effect relationships were found to be consistent with literature reports.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
3. Good Health and Well-being
(Web of Science; OpenAlex)
Source: Web Of Science
Added: August 2, 2021
2021 article
Trustworthy Knowledge Graph Population From Texts for Domain Query Answering
2021 IEEE INTERNATIONAL CONFERENCE ON BIG DATA (BIG DATA), pp. 4590–4599.
author keywords: Text data; populating knowledge graphs; ontology-based information extraction; feature engineering
TL;DR:
A scalable domain-independent text-to-KG approach that adapts to specific domains by using domain ontologies, without having to consult external triple repositories is introduced, which builds on the power of neural-based learning models and leverages feature engineering to distinguish ontology-aligned data from generic data in the source texts.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
16. Peace, Justice and Strong Institutions
(OpenAlex)
Source: Web Of Science
Added: July 5, 2022
2020 journal article
COVID-KOP: integrating emerging COVID-19 data with the ROBOKOP database
BIOINFORMATICS, 37(4), 586–587.
MeSH headings : COVID-19; Databases, Factual; Humans; Knowledge Bases; Pandemics; SARS-CoV-2
TL;DR:
COVID-KOP can be used effectively to generate new hypotheses concerning repurposing of known drugs and clinical drug candidates against COVID-19 by establishing respective confirmatory pathways of drug action.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
3. Good Health and Well-being
(Web of Science; OpenAlex)
Source: Web Of Science
Added: June 14, 2021
2019 book
Answering queries using views
San Rafael, CA: Morgan & Claypool Publishers.
Source: NC State University Libraries
Added: March 4, 2022
2018 article
Poster: Towards Greater Expressiveness, Flexibility, and Uniformity in Access Control
SACMAT'18: PROCEEDINGS OF THE 23RD ACM SYMPOSIUM ON ACCESS CONTROL MODELS & TECHNOLOGIES, pp. 217–219.
Contributors: J. Jiang n, n, J. Doyle n & A. Rosenthal *
author keywords: Attribute-based access control; security; policy formalism; logical models
TL;DR:
This work proposes to recasting the high-level structure of ABAC models in a logical formalism that treats all actions uniformly and that keeps existing policy languages in place by interpreting their attributes in terms of the restructured model.
(via Semantic Scholar)
Sources: Web Of Science, ORCID, NC State University Libraries
Added: August 12, 2019
2017 chapter
Differentially Private K-Skyband Query Answering Through Adaptive Spatial Decomposition
In Data and Applications Security and Privacy XXXI (pp. 142–163).
author keywords: k-skyband query; Differential privacy; Adaptive spatial decomposition
TL;DR:
This paper proposes a general technique BBS-Priv, which accepts any differentially private spatial decomposition tree as input and leverages data synthesis to answer \(k\)-skyband queries privately and proposes techniques to generate a k-skyband tree over spatial data that satisfies differential privacy.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
3. Good Health and Well-being
(Web of Science)
Source: Crossref
Added: February 24, 2020
2017 conference paper
Enabling query processing across heterogeneous data models: A survey
2017 IEEE International Conference on Big Data (Big Data), 3211–3220.
TL;DR:
A taxonomy for describing the state of the art is introduced and a systematic evaluation framework conducive to understanding of query-processing characteristics in the relevant systems is proposed, used to assess four representative implementations.
(via Semantic Scholar)
Source: NC State University Libraries
Added: August 6, 2018
2017 article
Exact Detection of Information Leakage: Decidability and Complexity
TRANSACTIONS ON LARGE-SCALE DATA- AND KNOWLEDGE-CENTERED SYSTEMS XXXII, Vol. 10420, pp. 1–23.
author keywords: Privacy and security in data-intensive systems; Information leakage; Data exchange
TL;DR:
Managing fine-grained access control in software is rather challenging and if access is not configured carefully, information leakage may happen: Users may infer sensitive information through the data explicitly accessible to them.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
3. Good Health and Well-being
(Web of Science)
16. Peace, Justice and Strong Institutions
(OpenAlex)
Source: Web Of Science
Added: December 3, 2018
2016 chapter
Knowledge-Guided Maximal Clique Enumeration
In Advanced Data Mining and Applications (pp. 604–618).
TL;DR:
The problem of knowledge-biased clique enumeration is introduced, a query-driven formulation that reduces output space, computation time, and memory usage, and a dynamic state space indexing strategy for efficiently processing multiple queries over the same graph is introduced.
(via Semantic Scholar)
Source: Crossref
Added: February 24, 2020
2016 article
Privacy-Preserving Two-Party Skyline Queries Over Horizontally Partitioned Data
INFORMATION SECURITY THEORY AND PRACTICE, WISTP 2016, Vol. 9895, pp. 187–203.
TL;DR:
This paper adopts the classical honest-but-curious attack model, and design a suite of efficient protocols for skyline queries over horizontally partitioned data, and analyzes in detail the efficiency of each of the proposed protocols as well as their privacy guarantees.
(via Semantic Scholar)
Source: Web Of Science
Added: August 6, 2018
2016 conference paper
Toward entrepreneurial pedagogies: rethinking professional networking as knowledge making
2016 ieee international professional communication conference (ipcc).
TL;DR:
It is suggested that instructors and students should understand professional social networking as a multilayered practice of learning and sharing collective knowledge.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
8. Decent Work and Economic Growth
(OpenAlex)
Sources: NC State University Libraries, NC State University Libraries
Added: August 6, 2018
2015 journal article
Combined-semantics equivalence of conjunctive queries: Decidability and tractability results
Journal of Computer and System Sciences, 82(3), 395–465.
author keywords: Combined semantics for query processing; Query containment; Query equivalence
TL;DR:
This study introduces a containment-based algorithm for deciding combined-semantics equivalence of conjunctive (CQ) queries that belong to a large well-behaved class of “explicit-wave” queries and single out a subclass of explicit-wave CQ queries for which it is tractable to determine combined- Semantic equivalence.
(via Semantic Scholar)
Source: Crossref
Added: December 31, 2020
2015 chapter
Determining Query Readiness for Structured Data
In Big Data Analytics and Knowledge Discovery (Vol. 9263, pp. 3–14).
author keywords: Big data quality; Big data analytics and user interfaces; Data readiness level; Data quality measurement; Data quality improvement
TL;DR:
This study provides a formalization of DRL in a structured-data scenario, and illustrates how knowledge of rules and facts can be used to identify those transformations of the data that improve its DRL.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
16. Peace, Justice and Strong Institutions
(OpenAlex)
Sources: Crossref, ORCID
Added: December 6, 2019
2015 conference paper
Determining query readiness for structured data
Big data analytics and knowledge discovery, 9263, 3–14.
Source: NC State University Libraries
Added: August 6, 2018
2015 article
Exact Detection of Information Leakage in Database Access Control
BIG DATA ANALYTICS AND KNOWLEDGE DISCOVERY, Vol. 9263, pp. 403–415.
author keywords: Privacy and security in cloud intelligence; Data exchange
TL;DR:
Managing fine-grained access control in software is rather challenging and if access is not configured carefully, information leakage may happen: Users may infer sensitive information through the data explicitly accessible to them in centralized systems or in the cloud.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
3. Good Health and Well-being
(Web of Science)
16. Peace, Justice and Strong Institutions
(OpenAlex)
Source: Web Of Science
Added: August 6, 2018
2013 journal article
Combined-Semantics Equivalence and Minimization of Conjunctive Queries
COMPUTER JOURNAL, 57(5), 775–795.
author keywords: combined semantics for query processing; query minimization; query equivalence
Source: Web Of Science
Added: August 6, 2018
2013 journal article
Query optimization in information integration
Acta Informatica, 50(4), 257–287.
TL;DR:
This paper uses synthetic and real-life datasets in the implementation of an information integration system shell to provide experimental results that demonstrate that the algorithms proposed could form a basis for scalable query processing in information integration and interoperability in many practical settings.
(via Semantic Scholar)
Source: Crossref
Added: February 24, 2020
2012 journal article
An integer programming approach for the view and index selection problem
Data & Knowledge Engineering, 83, 111–125.
author keywords: Business intelligence; Data warehouse and repository; OLAP; Materialized views; View and index selection; Integer programming; Heuristics
TL;DR:
This work proposes an integer programming model for the OLAP view- and index-selection problem and uses heuristic strategies to further reduce the size of this IP model and dramatically reduce its execution time, although it no longer guarantees that the reduced IP model offers a globally optimal solution for the original problem.
(via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: February 24, 2020
2012 chapter
Deterministic View Selection for Data-Analysis Queries: Properties and Algorithms
In Advances in Databases and Information Systems (pp. 195–208).
TL;DR:
This work poses the view-selection problem as an integer programming model, study its structural properties, and proposes effective techniques for reducing the search space of views and thus the size of the corresponding IP model.
(via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: February 24, 2020
2012 book
Materialized views
Boston, [Massachusetts]: now Pub.
Source: NC State University Libraries
Added: August 6, 2018
2012 journal article
Tractable XML data exchange via relations
FRONTIERS OF COMPUTER SCIENCE, 6(3), 243–263.
author keywords: data exchange; XML; XML shredding; inlining
TL;DR:
A set of five requirements that must be fulfilled in order to have a faithful representation of the XML data-exchange problem by a relational translation are isolated and it is demonstrated that these requirements naturally suggest the in-lining technique for data-Exchange tasks.
(via Semantic Scholar)
Source: Web Of Science
Added: August 6, 2018
2012 chapter
Two-Stage Stochastic View Selection for Data-Analysis Queries
In Advances in Intelligent Systems and Computing (pp. 115–123).
TL;DR:
This work considers the problem of selecting an optimal set of views to answer a given collection of queries at the present time as a two-stage stochastic programming problem and shows that this model is equivalent to an integer programming (IP) model that can be solved via various commercial IP solvers.
(via Semantic Scholar)
Source: Crossref
Added: February 24, 2020
2010 journal article
Selecting and using views to compute aggregate queries
Journal of Computer and System Sciences, 77(6), 1079–1107.
TL;DR:
A workload of aggregate queries is considered and the problem of selecting materialized views that provide equivalent rewritings for all the queries, and are optimal, is investigated, in that the cost of evaluating the query workload is minimized.
(via Semantic Scholar)
Source: NC State University Libraries
Added: August 6, 2018
2009 chapter
Approximate Rewriting of Queries Using Views
In Advances in Databases and Information Systems (pp. 164–178).
TL;DR:
A sound and complete algorithm for constructing a maximally-contained rewriting (MCR) whose all CQAC disjuncts have up to a predetermined number of view literals and which has the minimum possible number of relational subgoals.
(via Semantic Scholar)
Source: Crossref
Added: February 24, 2020
2009 chapter
Systematic Exploration of Efficient Query Plans for Automated Database Restructuring
In Advances in Databases and Information Systems (pp. 133–148).
TL;DR:
This work proposes a framework and algorithms that enable selection of views/indexes that contribute to the most efficient plans for the input queries, subject to the space bound, and presents strong optimality guarantees on the architecture.
(via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: February 24, 2020
2008 journal article
Query optimization using restructured views: Theory and experiments
INFORMATION SYSTEMS, 34(3), 353–370.
author keywords: Query optimization; Restructured views; Query optimization using materialized views
TL;DR:
A general query-optimization framework that treats regular and restructured views in a uniform manner and is applicable to SQL select-project-join queries and views without or with aggregation, and develops techniques for determining the key of a (regular or restructured) view, and shows how this information can be used to further optimize a rewritten query.
(via Semantic Scholar)
Source: Web Of Science
Added: August 6, 2018
2007 review
Efficiently querying large XML data repositories: A survey
[Review of ]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 19(10), 1381–1403.
author keywords: XML query processing; twig pattern matching
TL;DR:
This survey considers two classes of major XML query processing techniques: the relational approach and the native approach, which could result in higher query processing performance and also significantly reduce system reengineering costs.
(via Semantic Scholar)
Source: Web Of Science
Added: August 6, 2018
2007 journal article
View selection for real conjunctive queries
ACTA INFORMATICA, 44(5), 289–321.
TL;DR:
This paper studies the complexity of the view-selection problem for conjunctive queries and views under set semantics, and shows that bag semantics is the “easiest to handle”, whereas under set and bag-set semantics the authors assume further restrictions on the query workload to achieve the same complexity.
(via Semantic Scholar)
Source: Web Of Science
Added: August 6, 2018
2006 chapter
Finding equivalent rewritings in the presence of arithmetic comparisons
In Advances in database technology : EDBT 2006 : 10th International Conference on Extending Database Technology, Munich, Germany, March 26-31, 2006: Proceedings (Lecture notes in computer science; 3896) (Vol. 3896, pp. 942–960).
TL;DR:
This work presents an efficient algorithm which will perform better on average than the complete enumeration algorithm and considers fewer candidate rewritings because it includes a preliminary test to decide for each view whether it is potentially useful in some rewriting.
(via Semantic Scholar)
Source: NC State University Libraries
Added: August 6, 2018
2005 chapter
A Formal Model for the Problem of View Selection for Aggregate Queries
In Advances in Databases and Information Systems (pp. 125–138).
TL;DR:
This paper uses an integer-programming model to obtain optimal solutions to the problem of view selection for aggregate queries on data warehouses and reports the results of the post-optimality analysis that was performed to determine the impact of changing certain input characteristics on the optimal solution.
(via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: February 24, 2020
2005 journal article
Answering queries using materialized views with minimum size
VLDB JOURNAL, 15(3), 191–210.
author keywords: views; data warehouses; minimum-size viewsets; distributed systems
TL;DR:
This paper presents techniques for finding a minimum-size viewset for a single query without self-joins, and describes a very compact search space of views, which contains all views in at least one optimal viewset.
(via Semantic Scholar)
Source: Web Of Science
Added: August 6, 2018
2005 chapter
Designing and using views to improve performance of aggregate queries (extended abstract)
In B. C. O. L. Zhou & X. Meng (Eds.), Database systems for advanced applications: 10th international conference, DASFAA 2005, Beijing, China, April 17-20, 2005: Proceedings (Lecture notes in computer science ; 3454) (Vol. 3453, pp. 548–554).
Ed(s): B. L. Zhou & X. Meng
TL;DR:
This work presents a system architecture for Query-Performance Enhancement by Tuning (QPET), which combines design and use of derived data in an end-to-end approach to automated query-performance tuning.
(via Semantic Scholar)
Source: NC State University Libraries
Added: August 6, 2018
2005 chapter
Designing views to efficiently answer real SQL queries
In J-D. Zucker & L. Saitta (Eds.), Abstraction, reformulation and approximation: 6th international symposium, SARA 2005, Airth Castle, Scotland, UK, July 26-29, 2005: proceedings (Lecture notes in computer science, Lecture notes in artificial intelligence; 3607) (Vol. 3607, pp. 332–346).
Ed(s): . J-D. Zucker & L. Saitta
TL;DR:
This paper presents results on selecting views to answer queries in relational databases under set, bag, and bag-set semantics, to find sound and complete algorithms for designing views and rewriting queries efficiently.
(via Semantic Scholar)
Source: NC State University Libraries
Added: August 6, 2018
2004 chapter
Adding AI to Web Services
In Agent-Mediated Knowledge Management (pp. 322–338).
TL;DR:
The FX-Project consisted of members of the Stanford Logic Group industrial visitors from NEC and Intec Web & Genome working together to develop a new technologies based upon the combination of web services and techniques from artificial intelligence using the experience in AI-based software agents.
(via Semantic Scholar)
Source: Crossref
Added: February 24, 2020
2004 journal article
Deriving efficient SQL sequences via read-aheads
Lecture Notes in Computer Science, 3181, 299–308.
TL;DR:
The proposed solution uses data prefetching (read-aheads) to minimize the total data-access time of an application, in a manner that affects neither the application code nor the backend DBMS.
(via Semantic Scholar)
Sources: NC State University Libraries, ORCID, NC State University Libraries
Added: August 6, 2018
2004 chapter
Selecting and using views to compute aggregate queries (extended abstract)
In T. Eiter & L. Libkin (Eds.), Database theory: ICDT 2005, 10th international conference, Edinburgh, UK, January 5-7, 2005: Proceedings (Lecture notes in computer science ; 3363) (Vol. 3363, pp. 383–397).
Ed(s): . T. Eiter & L. Libkin
TL;DR:
A workload of aggregate queries is considered and the problem of selecting views that provide equivalent rewritings for all queries are investigated, finding that optimal views are optimal, in that the cost of evaluating the query workload is minimized.
(via Semantic Scholar)
Source: NC State University Libraries
Added: August 6, 2018
2003 chapter
Improving query performance using materialized XML views: A learning-based approach
In Conceptual modeling for novel application domains: ER 2003 workshops ECOMO, IWCMQ, AOIS, and XSDM, Chicago, IL, USA, October 13, 2003: proceedings / Manfred Jeusfeld; Oscar Pastor (eds.). New York: Springer-Verlag, 2003. (Lecture notes in computer science ; 2814). (Vol. 2814, pp. 297–310).
TL;DR:
This paper shows that selective materialization of data as XML views reduces query-execution costs in relatively static databases and can significantly reduce processing costs for frequent and important queries on relational databases with XML interfaces.
(via Semantic Scholar)
Source: NC State University Libraries
Added: August 6, 2018
Citation Index includes data from a number of different sources. If you have questions about the sources of data in the Citation Index or need a set of data which is free to re-distribute, please contact us.
Certain data included herein are derived from the Web of Science© and InCites© (2024) of Clarivate Analytics. All rights reserved. You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.