Abir Qasem

dblp:80/6323 · DBLP profile ↗
← Back
7ranked-venue papers
1as first author
0since 2021 · last 2010
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 5 · 1 first-authorArtificial intelligence and machine learning · 4 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 2

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
2 papers
Knowledge graphs · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Performance modeling and evaluation · 100%
Artificial intelligence
1 paper
Knowledge representation and reasoning · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Knowledge graphs
semantic web
0.122007
A Requirements Driven Framework for Benchmarking Semantic Web Knowledge Base Systems · IEEE Trans. Knowl. Data Eng. 2007
An Investigation into the Feasibility of the Semantic Web · AAAI 2006
Performance modeling and evaluation
benchmarking
0.112007
A Requirements Driven Framework for Benchmarking Semantic Web Knowledge Base Systems · IEEE Trans. Knowl. Data Eng. 2007
Knowledge, reasoning and agents › Knowledge representation and reasoning
knowledge-based systems
0.112006
Large Scale Knowledge Base Systems: An Empirical Evaluation Perspective · AAAI 2006

Methods — techniques the papers use, named apart from their topics

semantic web technologies · 0.1
YearPublicationVenuePosition
2010 A Scalable Indexing Mechanism for Ontology-Based Information Integration
abstract
In recent years, there has been an explosion of publicly available RDF and OWL web pages. Typically, these pages are small, heterogeneous and prone to change frequently. In order to effectively integrate them, we propose to adapt a query reformulation algorithm and combine it with an information retrieval inspired index in order to select all sources relevant to a query. We treat each RDF document as a bag of URIs and literals and build an inverted index. Our system first reformulates the user’s query into a set of sub goals and then translates these into Boolean queries against the index in order to determine which sources are relevant. Finally, the selected data sources and the relevant ontology mappings are used in conjunction with a description logic reasoner to provide an efficient query answering solution for the Semantic Web. We have evaluated our system using ontology mappings and ten million real world data sources.
Yingjie Li 0004, Abir Qasem, Jeff Heflin
Web Intelligence2
2008 Goal Node Search for Semantic Web Source Selection
abstract
We present an efficient search approach for selecting all potentially relevant data sources for a conjunctive Semantic Web query. We use map ontologies to align heterogeneous domain ontologies. This allows us to select data sources that may be relevant to the query but generally do not describe their data directly in terms of the ontology of the query. The "goal node search" algorithm is a significant improvement on our original source selection algorithm. The new algorithm allows a more expressive knowledge representation language to describe domain ontologies and it is about three times more efficient than the original source selection algorithm when performing similar tasks.
Abir Qasem, Dimitre A. Dimitrov, Jeff Heflin
Web Intelligence1
2007 A Requirements Driven Framework for Benchmarking Semantic Web Knowledge Base Systems
abstract
A key challenge for the semantic Web is to acquire the capability to effectively query large knowledge bases. As there will be several competing systems, we need benchmarks that will objectively evaluate these systems. Development of effective benchmarks in an emerging domain is a challenging endeavor. In this paper, we propose a requirements driven framework for developing benchmarks for semantic Web knowledge base systems (SW KBSs). In this paper, we make two major contributions. First, we provide a list of requirements for SW KBS benchmarks. This can serve as an unbiased guide to both the benchmark developers and personnel responsible for systems acquisition and benchmarking. Second, we provide an organized collection of techniques and tools needed to develop such benchmarks. In particular, the collection contains a detailed guide for generating benchmark workload, defining performance metrics, and interpreting experimental results
Abir Qasem, Zhengxiang Pan, Jeff Heflin
IEEE Trans. Knowl. Data Eng.2
2006 Large Scale Knowledge Base Systems: An Empirical Evaluation Perspective
Abir Qasem, Jeff Heflin
AAAI2
2006 An Investigation into the Feasibility of the Semantic Web
Zhengxiang Pan, Abir Qasem, Jeff Heflin
AAAI2
2006 Information Integration Via an End-to-End Distributed Semantic Web System
Dimitre A. Dimitrov, Jeff Heflin, Abir Qasem, Nanbor Wang
ISWC3
2005 Rapid Benchmarking for Semantic Web Knowledge Base Systems
Sui-Yu Wang, Abir Qasem, Jeff Heflin
ISWC3