Works (37)
Updated: April 4th, 2024 13:11
2021 article
Hybrid Blockchain Architecture for Cloud Manufacturing-as-a-service (CMaaS) Platforms with Improved Data Storage and Transaction Efficiency
49TH SME NORTH AMERICAN MANUFACTURING RESEARCH CONFERENCE (NAMRC 49, 2021), Vol. 53, pp. 594–605.
author keywords: blockchain; smart contracts; distributed database; time series; regression; lstm; gas price prediction
TL;DR:
A Random Forest regressor based time series inference model has been shown to exhibit superior performance in the prediction of Ethereum gas price, that allows the CMaaS to avoid executing transactions in periods of high gas prices within the Ethereum ecosystem.
(via Semantic Scholar)
doi.org (publisher)
Sources: Web Of Science, NC State University Libraries
Added: October 24, 2022
2019 chapter
Evaluating Generalized Path Queries by Integrating Algebraic Path Problem Solving with Graph Pattern Matching
In Lecture Notes in Computer Science.
TL;DR:
This paper focuses on path querying on Semantic Networks, and examines the need for the set version of various path problem i.e. finding paths between multiple source and multiple destination nodes.
(via Semantic Scholar)
Source: ORCID
Added: May 1, 2020
2019 conference paper
Semantic query transformations for increased parallelization in distributed knowledge graph query processing
Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis.
author keywords: Graph and network algorithms; improved models; algorithms; performance or scalability of specific applications and respective software; cloud workflow; data; resource management including dynamic resource provisioning; data analytics and frameworks supporting data analytics; Scalable storage; metadata; namespaces; data management
TL;DR:
This paper proposes data and query transformations that enable inter-operator parallelism of ontological queries on Hadoop platforms and exploits ontological axioms, second order data types and operator rewritings to eliminate expensive query substructures for increased parallelizability.
(via Semantic Scholar)
Source: ORCID
Added: May 1, 2020
2018 conference paper
Scalable Exploratory Search on Knowledge Graphs Using Apache Spark
2018 IEEE 27th International Conference on Enabling Technologies: Infrastructure for Collaborative Enterprises (WETICE).
TL;DR:
An incremental query execution model RAPIDFacet is proposed, that exploits the iterative nature of faceted search and reuses intermediate results and is built on top of Apache Spark which naturally supports iterative models and the Nested Triplegroup Data Model and Algebra.
(via Semantic Scholar)
Source: ORCID
Added: May 1, 2020
2017 conference paper
A semantics-aware storage framework for scalable processing of knowledge graphs on hadoop
2017 IEEE International Conference on Big Data (Big Data), 193–202.
TL;DR:
The design of a Hadoop-based storage architecture for knowledge graphs that overcomes some of the challenges of big RDF data processing and enables the enabling of semantic-awareness in storage framework is presented.
(via Semantic Scholar)
Sources: NC State University Libraries, NC State University Libraries
Added: August 6, 2018
2017 conference paper
Type-based Semantic Optimization for Scalable RDF Graph Pattern Matching
Proceedings of the 26th International Conference on World Wide Web.
TL;DR:
This paper proposes a novel type system for RDF data induced from data and ontologies and a query optimization and evaluation framework for evaluating graph pattern queries using type-based optimizations, which is up to 500X faster than existing approaches.
(via Semantic Scholar)
Source: ORCID
Added: May 1, 2020
2015 conference paper
Rewriting complex SPARQL analytical queries for efficient cloud-based processing
Proceedings 2015 IEEE International Conference on Big Data, 32–37.
TL;DR:
This paper proposes a holistic approach to optimize RDF analytical queries by refactoring queries to achieve shared execution of common subexpressions that enables parallel evaluation of groupings as well as aggregations and can achieve more efficient execution plans when compared to relational-style SPARQL query plans executed on popular Cloud systems.
(via Semantic Scholar)
Sources: NC State University Libraries, NC State University Libraries
Added: August 6, 2018
2014 journal article
Algebraic optimization of RDF graph pattern queries on MapReduce
Large Scale and Big Data: Processing and Management, 183–227.
Sources: NC State University Libraries, NC State University Libraries
Added: August 6, 2018
2014 chapter
Enabling a Package Query Paradigm on the Semantic Web: Model and Algorithms
In A. Hameurlain, J. Küng, & R. Wagner (Eds.), Transactions on Large-Scale Data- and Knowledge-Centered Systems XIII (pp. 1–32).
Ed(s): A. Hameurlain, J. Küng & R. Wagner
TL;DR:
The traditional search model of finding links on the Internet is unsatisfactory for the increasingly complex tasks that seek to leverage the diverse, increasingly structured and semantically annotated data on the Web.
(via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: April 29, 2021
2014 journal article
Nesting Strategies for Enabling Nimble MapReduce Dataflows for Large RDF Data
INTERNATIONAL JOURNAL ON SEMANTIC WEB AND INFORMATION SYSTEMS, 10(1), 1–26.
author keywords: Hadoop; MapReduce; Multi-Valued Properties; RDF Graph Pattern Queries; Semantic Web; SPARQL; Unnesting Strategies
TL;DR:
This paper argues for the use of a nested data model for representing intermediate data concisely using nesting-aware dataflow operators that allow for lazy and partial unnesting strategies and confirms their superiority over relational-style MapReduce systems such as Apache Pig and Hive.
(via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018
2014 chapter
SYRql: A Dataflow Language for Large Scale Processing of RDF Data
In The Semantic Web – ISWC 2014 (pp. 147–163).
TL;DR:
SYRql is introduced, a dataflow language designed to process RDF data at a large scale that blends concepts from both SPARQL and existing big data languages and is compared to other big data processing languages.
(via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: November 24, 2020
2013 conference paper
A vision for SPARQL multi-query optimization on MapReduce
2013 ieee 29th international conference on data engineering workshops (icdew), 25–26.
TL;DR:
This paper lays out a vision for rule-based multi-query optimization based on a recently proposed data model and algebra, Nested TripleGroup Data Model and Algebra, for efficient SPARQL query processing on MapReduce.
(via Semantic Scholar)
Sources: NC State University Libraries, NC State University Libraries
Added: August 6, 2018
2013 journal article
Algebraic Optimization for Processing Graph Pattern Queries in the Cloud
IEEE INTERNET COMPUTING, 17(2), 52–61.
TL;DR:
An algebraic optimization approach based on a Nested TripleGroup Data Model and Algebra (NTGA) that minimizes overall processing costs by reducing the number of MapReduce cycles is presented.
(via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018
2013 conference paper
Optimizing queries over semantically integrated datasets on mapreduce platforms
2013 IEEE International Conference on Big Data.
TL;DR:
This poster focuses on optimizing UNION queries (e.g., unions of conjunctives for inference) and presents an algebraic interpretation of the query rewritings which are more amenable to efficient processing on MapReduce.
(via Semantic Scholar)
Sources: NC State University Libraries, NC State University Libraries
Added: August 6, 2018
2013 conference paper
Scaling concurrency of personalized semantic search over large RDF data
2013 IEEE International Conference on Big Data.
TL;DR:
A lightweight interpretation approach that employs indexing to improve throughput and concurrency with much less memory overhead and is also more amenable to distributed or partitioned execution is proposed.
(via Semantic Scholar)
Sources: NC State University Libraries, NC State University Libraries
Added: August 6, 2018
2013 chapter
SkyPackage: From Finding Items to Finding a Skyline of Packages on the Semantic Web
In Semantic Technology (pp. 49–64).
TL;DR:
Enabling complex querying paradigms over the wealth of available Semantic Web data will significantly impact the relevance and adoption ofSemantic Web technologies in a broad range of domains.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
16. Peace, Justice and Strong Institutions
(OpenAlex)
Sources: ORCID, Crossref, NC State University Libraries
Added: May 10, 2020
2012 chapter
HIP: Information Passing for Optimizing Join-Intensive Data Processing Workloads on Hadoop
In Lecture Notes in Computer Science (pp. 384–391).
TL;DR:
This paper presents an information passing technique (HIP) that can minimize the size of intermediate data on Hadoop-based data processing platforms.
(via Semantic Scholar)
Sources: ORCID, Crossref, NC State University Libraries
Added: May 10, 2020
2012 conference paper
Scan-Sharing for Optimizing RDF Graph Pattern Matching on MapReduce
2012 IEEE Fifth International Conference on Cloud Computing.
TL;DR:
This work presents a scan-sharing technique that is used to optimize the processing of graph patterns with repeated properties that eliminates the need for repeated scanning of input relations when properties are used repeatedly in graph patterns.
(via Semantic Scholar)
Source: ORCID
Added: May 10, 2020
2012 conference paper
To nest or not to nest, when and how much
Proceedings of the 4th International Workshop on Semantic Web Information Management - SWIM '12.
TL;DR:
This short paper presents some on-going research into the use of a nested TripleGroup data model and Algebra (NTGA) for MapReduce based RDF graph processing and a preliminary evaluation of these strategies for efficient management of multi-valued properties while processing graph pattern queries in Apache Pig.
(via Semantic Scholar)
Source: ORCID
Added: May 10, 2020
2011 chapter
An Intermediate Algebra for Optimizing RDF Graph Pattern Matching on MapReduce
In The Semanic Web: Research and Applications (pp. 46–61).
TL;DR:
This paper proposes an approach for optimizing graph pattern matching by reinterpreting certain join tree structures as grouping operations which enables a greater degree of parallelism in join processing resulting in more "bushy" like query execution plans with fewer Map-Reduce cycles.
(via Semantic Scholar)
Sources: ORCID, Crossref, NC State University Libraries
Added: May 10, 2020
2011 conference paper
CoSi
Proceedings of the 20th international conference companion on World wide web - WWW '11.
TL;DR:
The demo will present CoSi, a system that enables context-sensitive interpretation of keyword queries on RDF databases that captures a user's querying context from their query history and shows how context is utilized to influence the interpretation of a new query.
(via Semantic Scholar)
Source: ORCID
Added: May 10, 2020
2011 chapter
Effectively Interpreting Keyword Queries on RDF Databases with a Rear View
In The Semantic Web – ISWC 2011 (pp. 193–208).
TL;DR:
This paper proposes a context-aware approach for keyword query interpretation that personalizes the interpretation process based on a user's query context and outperforms the state-of-the-art technique on both efficiency and effectiveness, particularly for ambiguous queries.
(via Semantic Scholar)
Sources: ORCID, Crossref, NC State University Libraries
Added: May 10, 2020
2011 chapter
Efficiently Evaluating Skyline Queries on RDF Databases
In The Semanic Web: Research and Applications (pp. 123–138).
TL;DR:
This paper presents an approach for optimizing skyline queries over RDF data stored using a vertically partitioned schema model based on the concept of a "Header Point" which maintains a concise summary of the already visited regions of the data space.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
16. Peace, Justice and Strong Institutions
(OpenAlex)
Sources: ORCID, Crossref, NC State University Libraries
Added: May 10, 2020
2011 journal article
From SPARQL to MapReduce: The Journey Using a Nested TripleGroup Algebra
Proc. VLDB Endow., 4(12), 1426–1429. http://www.vldb.org/pvldb/vol4/p1426-kim.pdf
Source: ORCID
Added: May 10, 2020
2010 conference paper
An agglomerative query model for discovery in linked data
Procceedings of the 13th International Workshop on the Web and Databases - WebDB '10.
TL;DR:
This paper introduces the notion of agglomerative querying for supporting "search processes" and presents its motivation, challenges and formalization, and presents a preliminary implementation approach for processing such queries and discusses its relationship with SPARQL query processing.
(via Semantic Scholar)
Source: ORCID
Added: May 2, 2020
2010 conference paper
Disambiguating Keyword Queries on RDF Databases Using "Deep" Segmentation
2010 IEEE Fourth International Conference on Semantic Computing, 236–243.
author keywords: Segmentation; Keyword Query; Interpretation; RDF
TL;DR:
A “deep segmentation” technique for keyword queries issued against an RDF database that achieves a more aggressive pruning of irrelevant interpretations from the space of interpretations considered and therefore produces better quality query interpretations even in the presence of significant query ambiguity.
(via Semantic Scholar)
Source: ORCID
Added: May 2, 2020
2010 chapter
EI2N’10 & SeDeS’10 - PC Co-chairs Message
EI2N’10 & SeDeS’10 - PC Co-chairs Message. In R. Meersman, T. Dillon, & P. Herrero (Eds.), On the Move to Meaningful Internet Systems: OTM 2010 Workshops (pp. 180–181).
Ed(s): R. Meersman, T. Dillon & P. Herrero
TL;DR:
The papers published in this volume of proceedings present samples of current research in the enterprise modelling, systems interoperability, services management, cloud integration and, more globally, systems engineering and enterprise architecture domains.
(via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: December 30, 2020
2010 chapter
EI2N’10 & SeDeS’10 - PC Co-chairs Message
EI2N’10 & SeDeS’10 - PC Co-chairs Message. In R. Meersman, T. Dillon, & P. Herrero (Eds.), On the Move to Meaningful Internet Systems: OTM 2010 Workshops (pp. 563–564).
Ed(s): R. Meersman, T. Dillon & P. Herrero
Sources: Crossref, NC State University Libraries
Added: December 30, 2020
2009 conference paper
RAPID: Enabling scalable ad-hoc analytics on the semantic web
Semantic web - iswc 2009, proceedings, 5823, 715–730.
TL;DR:
A language, RAPID, for scalable ad-hoc analytical processing of RDF data on Map-Reduce frameworks is presented, builds on Yahoo's Pig Latin by introducing primitives based on a specialized join operator, the MD-join, for expressing analytical tasks in a manner that is more amenable to parallel processing.
(via Semantic Scholar)
Sources: NC State University Libraries, NC State University Libraries, ORCID
Added: August 6, 2018
2008 chapter
Graph Summaries for Subgraph Frequency Estimation
In S. Bechhofer, M. Hauswirth, J. Hoffmann, & M. Koubarakis (Eds.), The Semantic Web: Research and Applications. ESWC 2008. (pp. 508–523).
Ed(s): S. Bechhofer, M. Hauswirth, J. Hoffmann & M. Koubarakis
TL;DR:
Two techniques for estimating the frequency of subgraphs from a summary of the data graph using a valuation scheme that blends information about their importance and estimation power are presented and evaluated.
(via Semantic Scholar)
Sources: Crossref, NC State University Libraries, ORCID
Added: May 2, 2020
2008 conference paper
Structure Discovery Queries in Disk-Based Semantic Web Databases
2008 Fourth International Conference on Semantics, Knowledge and Grid, 336–342.
TL;DR:
This paper presents a computational framework for efficiently evaluating a class of structure discovery queries based on an algebraic approach to solving path problems that leads to a natural disk storage model for graph data using traditional B+ tree index structures.
(via Semantic Scholar)
Source: ORCID
Added: May 2, 2020
2007 conference paper
Estimating the cardinality of RDF graph patterns
Proceedings of the 16th international conference on World Wide Web - WWW '07.
TL;DR:
This work proposes a pattern-based summarization framework for estimating the cardinality of RDF graph patterns and presents experiments on real world and synthetic datasets which confirm the feasibility of this approach.
(via Semantic Scholar)
Source: ORCID
Added: May 1, 2020
2007 conference paper
SPARQ2L
Proceedings of the 16th international conference on World Wide Web - WWW '07.
TL;DR:
A query language SPARQ2L which extends SPARQL with path variables and path variable constraint expressions, and a novel query evaluation framework based on efficient algebraic techniques for solving path problems which allows for path queries to be efficiently evaluated on disk resident RDF graphs are presented.
(via Semantic Scholar)
Source: ORCID
Added: May 2, 2020
2005 conference paper
SemRank
Proceedings of the 14th international conference on World Wide Web - WWW '05.
TL;DR:
An approach that ranks results based on how predictable a result might be for users is presented, based on a relevance model SemRank, which is a rich blend of semantic and information-theoretic techniques with heuristics that supports the novel idea of modulative searches, where users may vary their search modes to effect changes in the ordering of results depending on their need.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
9. Industry, Innovation and Infrastructure
(OpenAlex)
Source: ORCID
Added: May 1, 2020
2005 journal article
Semantic Association Identification and Knowledge Discovery for National Security Applications
Journal of Database Management.
author keywords: content analytics; knowledge discovery; ontology; RDF; semantic analytics; semantic applications for homeland security; semantic association; semantic metadata; semantic web technology
TL;DR:
This paper discusses semantic approaches to support analytics on vast amounts of heterogeneous data and brings together novel academic research and commercialized Semantic Web technology for semantic metadata extraction.
(via Semantic Scholar)
Source: ORCID
Added: May 1, 2020
2003 conference paper
Ρ-Queries:: enabling querying for semantic associations on the semantic web
Proceedings of the twelfth international conference on World Wide Web - WWW '03.
TL;DR:
This paper presents the notion of Semantic Associations as complex relationships between resource entities based on a specific notion of similarity called r-isomorphism, and formalizes these notions for the RDF data model, by introducing a notion of a Property Sequence as a type.
(via Semantic Scholar)
Source: ORCID
Added: May 1, 2020
2002 journal article
The ρ operator
ACM SIGMOD Record.
TL;DR:
An approach that supports querying for Semantic Associations on the Semantic Web has four main facets, and uses a graph data model for knowledge representation, allowing the semantic associations search techniques to be built upon the graph algorithms for paths, while integrating knowledge from the schema into the search process.
(via Semantic Scholar)
Source: ORCID
Added: May 1, 2020
Employment
Updated: May 7th, 2020 14:27
2007 - present
North Carolina State University Raleigh, NC, US
Associate Professor
Computer Science
2006 - 2006
HP Labs Palo Alto, CA, US
Graduate Student Intern
1990 - 1992
Serex Inc Maplewood, NJ, US
Quality Control Chemist
Quality Control
Education
Updated: May 7th, 2020 14:33
University of Georgia Athens, GA, US
Ph.D.
Computer Science
1985 - 1989
University of Nigeria Nsukka, Enugu, NG
B.Sc
Biochemistry
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.
