default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHouari Mahfoud
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c10]Houari Mahfoud:
Diversified Top-k Answering of Cypher Queries over Large Data Graphs. AICCSA 2023: 1-8- [c9]Adil Achraf Bereksi Reguig
, Houari Mahfoud, Abdessamad Imine:
Towards an Effective Attribute-Based Access Control Model for Neo4j. MEDI 2023: 352-366 - 2022
- [j4]Houari Mahfoud:
Expressive top-k matching for conditional graph patterns. Neural Comput. Appl. 34(17): 14205-14221 (2022) - [c8]Houari Mahfoud:
Towards a Strong Containment for Efficient Matching of Expressive Graph Patterns. MEDES 2022: 48-55 - [c7]Abdelkrim Boudaoud, Houari Mahfoud, Azeddine Chikh:
Towards a Complete Direct Mapping from Relational Databases to Property Graphs. MEDI 2022: 222-235 - [i5]Houari Mahfoud:
Revisited Containment for Graph Patterns. CoRR abs/2207.13017 (2022) - [i4]Abdelkrim Boudaoud, Houari Mahfoud, Azeddine Chikh:
Towards a Complete Direct Mapping From Relational Databases To Property Graphs. CoRR abs/2210.00457 (2022) - 2020
- [j3]Houari Mahfoud:
Graph pattern matching with counting quantifiers and label-repetition constraints. Clust. Comput. 23(3): 1529-1553 (2020) - [c6]Houari Mahfoud:
Conditional Graph Pattern Matching with a Basic Static Analysis. MedPRAI 2020: 298-313
2010 – 2019
- 2018
- [c5]Houari Mahfoud:
Graph Pattern Matching Preserving Label-Repetition Constraints. MEDI 2018: 268-281 - [i3]Houari Mahfoud:
Graph Pattern Matching Preserving Label-Repetition Constraints. CoRR abs/1804.04260 (2018) - 2015
- [j2]Mumtaz Ahmad, Abdessamad Imine, Houari Mahfoud:
A Highly Concurrent Replicated Data Structure EAI Endorsed Transactions. EAI Endorsed Trans. Collab. Comput. 1(6): e4 (2015) - [j1]Houari Mahfoud, Abdessamad Imine:
Efficient Querying of XML Data Through Arbitrary Security Views. Trans. Large Scale Data Knowl. Centered Syst. 22: 75-114 (2015) - 2014
- [b1]Houari Mahfoud:
Efficient Access Control to XML Data: Querying and Updating Problems. (Contrôle d'Accès Efficace pour des Données XML: problèmes d'interrogation et de mise-à-jour). University of Lorraine, Nancy, France, 2014 - 2013
- [c4]Houari Mahfoud, Abdessamad Imine, Michaël Rusinowitch:
SVMAX: a system for secure and valid manipulation of XML data. IDEAS 2013: 154-161 - 2012
- [c3]Houari Mahfoud, Abdessamad Imine:
On Securely Manipulating XML Data. FPS 2012: 293-307 - [c2]Houari Mahfoud, Abdessamad Imine:
A General Approach for Securely Updating XML Data. WebDB 2012: 55-60 - [c1]Houari Mahfoud, Abdessamad Imine:
Secure querying of recursive XML views: a standard xpath-based technique. WWW (Companion Volume) 2012: 575-576 - [i2]Houari Mahfoud, Abdessamad Imine:
A General Approach for Securely Querying and Updating XML Data. CoRR abs/1202.0018 (2012) - 2011
- [i1]Houari Mahfoud, Abdessamad Imine:
Secure Querying of Recursive XML Views: A Standard XPath-based Technique. CoRR abs/1112.2605 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
