Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jihad Boulos

dblp:87/100 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
0since 2021 · last 2006
—ORCID · none

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

Databases, data management, data science and information retrieval · 4 · 3 first-authorSoftware engineering, systems software and programming languages · 1Applied, interdisciplinary, general and emerging computing · 1

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
1 paper
Database theory · 44% Data integration and cleaning · 44% Query processing and optimization · 13%

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

TopicWeightPapersLastEvidence papers
Data integration and cleaning
data quality
0.112005
MYSTIQ: a system for finding more answers by using probabilities · SIGMOD Conference 2005
Database theory › probabilistic databases
probabilistic query semantics
0.112005
MYSTIQ: a system for finding more answers by using probabilities · SIGMOD Conference 2005

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

probabilistic query semantics · 0.1
YearPublicationVenuePosition
2006 A New Design for a Native XML Storage and Indexing Manager
Jihad Boulos, Shant Kirakos Karakashian
EDBT1
2006 XQueryViz: An XQuery Visualization Tool
Jihad Boulos, Marcel Karam, Zeina Koteiche, Hala Ollaic
EDBT1
2005 MYSTIQ: a system for finding more answers by using probabilities
abstract
MystiQ is a system that uses probabilistic query semantics [3] to find answers in large numbers of data sources of less than perfect quality. There are many reasons why the data originating from many different sources may be of poor quality, and therefore difficult to query: the same data item may have different representation in different sources; the schema alignments needed by a query system are imperfect and noisy; different sources may contain contradictory information, and, in particular, their combined data may violate some global integrity constraints; fuzzy matches between objects from different sources may return false positives or negatives. Even in such environment, users some-times want to ask complex, structurally rich queries, using query constructs typically found in SQL queries: joins, subqueries, existential/universal quantifiers, aggregate and group-by queries: for example scientists may use such queries to query multiple scientific data sources, or a law enforcement agency may use it in order to find rare associations from multiple data sources. If standard query semantics were applied to such queries, all but the most trivial queries will return an empty answer.
Jihad Boulos, Nilesh N. Dalvi, Bhushan Mandhani, Shobhit Mathur, Christopher Ré, Dan Suciu
SIGMOD Conference1
2005 Relaxing Result Accuracy for Performance in Publish/Subscribe Systems
Engie Bashir, Jihad Boulos
WISE2
1996 Performance Evaluation of the OLVP (Online Video Processing) System
abstract
The paper discusses how the OLVP system, an innovative video-on-demand system, can be used to efficiently support video delivery applications over an asynchronous transfer mode (ATM) network. We show how the OLVP system provided a high quality of service (QoS) to video applications executing over a set of distributed and heterogeneous system resources. System architecture is described. Key functionality, including distributed video storage management, real-time admission control strategy and resource allocation routing mechanism, traffic management and routing algorithms (both in the ATM network and in the OLVP system) are investigated. To illustrate the success of our approach, we provide a performance evaluation based on simulations of the system.
Frédéric Andrès, Keigo Ihara, Jihad Boulos, Kinji Ono, Yasuhiko Yasuda
COMPSAC3