Search For:

Displaying 1-13 out of 13 total
Algebraic Optimization for Processing Graph Pattern Queries in the Cloud
Found in: IEEE Internet Computing
By Kemafor Anyanwu,HyeongSik Kim,Padmashree Ravindra
Issue Date:March 2013
pp. 52-61
MapReduce platforms such as Hadoop are now the de facto standard for large-scale data processing, but they have significant limitations for join-intensive workloads typical in Semantic Web processing. This article overviews an algebraic optimization approa...
Scan-Sharing for Optimizing RDF Graph Pattern Matching on MapReduce
Found in: 2012 IEEE 5th International Conference on Cloud Computing (CLOUD)
By HyeongSik Kim,Padmashree Ravindra,Kemafor Anyanwu
Issue Date:June 2012
pp. 139-146
Recently, the number and size of RDF data collections has increased rapidly making the issue of scalable processing techniques crucial. The MapReduce model has become a de facto standard for large scale data processing using a cluster of machines in the cl...
Scheduling Hadoop Jobs to Meet Deadlines
Found in: Cloud Computing Technology and Science, IEEE International Conference on
By Kamal Kc, Kemafor Anyanwu
Issue Date:December 2010
pp. 388-392
User constraints such as deadlines are important requirements that are not considered by existing cloud-based data processing environments such as Hadoop. In the current implementation, jobs are scheduled in FIFO order by default with options for other pri...
Disambiguating Keyword Queries on RDF Databases Using
Found in: International Conference on Semantic Computing
By Haizhou Fu, Sidan Gao, Kemafor Anyanwu
Issue Date:September 2010
pp. 236-243
Keyword search on (semi)structured databases is an increasingly popular research topic. But existing techniques do not deal well with the problems presented by the queries that are ambiguous. Recent approaches for RDF databases try to improve the quality o...
Structure Discovery Queries in Disk-Based Semantic Web Databases
Found in: Semantics, Knowledge and Grid, International Conference on
By Kemafor Anyanwu, Pradeep Kumar Murukannaiah, Angela Maduko
Issue Date:December 2008
pp. 336-342
Link analysis tasks are fundamental to analytical applications in scientific research, business, national security, etc. Such tasks involve finding associations or interactions between entities e.g. people, chemical or genes. In graph theoretic terms, this...
A vision for SPARQL multi-query optimization on MapReduce
Found in: 2013 IEEE 29th International Conference on Data Engineering Workshops (ICDEW)
By Kemafor Anyanwu
Issue Date:April 2013
pp. 25-26
MapReduce has emerged as a key component of large scale data analysis in the cloud. However, it presents challenges for SPARQL query processing because of the absence of traditional join optimization machinery like statistics, indexes and techniques for tr...
Efficient processing of RDF graph pattern matching on MapReduce platforms
Found in: Proceedings of the second international workshop on Data intensive computing in the clouds (DataCloud-SC '11)
By HyeongSik Kim, Kemafor Anyanwu, Padmashree Ravindra, Seokyong Hong
Issue Date:November 2011
pp. 13-20
Broadened adoption of the Linking Open Data tenets has led to a significant surge in the amount of Semantic Web data, particularly RDF data. This has positioned the issue of scalable data processing techniques for RDF as a central issue in the Semantic Web...
CoSi: context-sensitive keyword query interpretation on RDF databases
Found in: Proceedings of the 20th international conference companion on World wide web (WWW '11)
By Haizhou Fu, Kemafor Anyanwu, Sidan Gao
Issue Date:March 2011
pp. 209-212
The demo will present CoSi, a system that enables context-sensitive interpretation of keyword queries on RDF databases. The techniques for representing, managing and exploiting query history are central to achieving this objective. The demonstration will s...
An agglomerative query model for discovery in linked data: semantics and approach
Found in: Procceedings of the 13th International Workshop on the Web and Databases (WebDB '10)
By Haizhou Fu, Kemafor Anyanwu, Sidan Gao
Issue Date:June 2010
pp. 1-6
Data on the Web is increasingly being used for discovery and exploratory tasks. Unlike traditional fact-finding tasks that require only the typical single-query and response paradigm, these tasks involve a multistage search process in which bits of informa...
Estimating the cardinality of RDF graph patterns
Found in: Proceedings of the 16th international conference on World Wide Web (WWW '07)
By Amit Sheth, Angela Maduko, Kemafor Anyanwu, Paul Schliekelman
Issue Date:May 2007
pp. 1233-1234
Most RDF query languages allow for graph structure search through a conjunction of triples which is typically processed using join operations. A key factor in optimizing joins is determining the join order which depends on the expected cardinality of inter...
SPARQ2L: towards support for subgraph extraction queries in rdf databases
Found in: Proceedings of the 16th international conference on World Wide Web (WWW '07)
By Amit Sheth, Angela Maduko, Kemafor Anyanwu
Issue Date:May 2007
pp. 797-806
Many applications in analytical domains often have the need to "connect the dots" i.e., query about the structure of data. In bioinformatics for example, it is typical to want to query about interactions between proteins. The aim of such queries is to "ext...
SemRank: ranking complex relationship search results on the semantic web
Found in: Proceedings of the 14th international conference on World Wide Web (WWW '05)
By Amit Sheth, Angela Maduko, Kemafor Anyanwu
Issue Date:May 2005
pp. 117-127
While the idea that querying mechanisms for complex relationships (otherwise known as Semantic Associations) should be integral to Semantic Web search technologies has recently gained some ground, the issue of how search results will be ranked remains larg...
Ρ-Queries: enabling querying for semantic associations on the semantic web
Found in: Proceedings of the twelfth international conference on World Wide Web (WWW '03)
By Amit Sheth, Kemafor Anyanwu
Issue Date:May 2003
pp. 690-699
This paper presents the notion of Semantic Associations as complex relationships between resource entities. These relationships capture both a connectivity of entities as well as similarity of entities based on a specific notion of similarity called r-isom...