default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHolger Meuss
Person information
- affiliation: Ludwig Maximilian University of Munich, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2005
[j4]Holger Meuss, Klaus U. Schulz, Felix Weigel, Simone Leonardi, François Bry
:
Visual exploration and retrieval of XML document collections with the generic system X2. Int. J. Digit. Libr. 5(1): 3-17 (2005)- [c12]Felix Weigel, Klaus U. Schulz, Holger Meuss:
Exploiting native XML indexing techniques for XML retrieval in relational database systems. WIDM 2005: 23-30 - [c11]Felix Weigel, Klaus U. Schulz, Holger Meuss:
The BIRD Numbering Scheme for XML and Tree Databases - Deciding and Reconstructing Tree Relations Using Efficient Arithmetic Operations. XSym 2005: 49-67 - [i1]Felix Weigel, Klaus U. Schulz, Holger Meuss:
Node Identification Schemes for Efficient XML Retrieval. Foundations of Semistructured Data 2005 - 2004
- [c10]Felix Weigel, Holger Meuss, François Bry, Klaus U. Schulz:
Content-Aware DataGuides: Interleaving IR and DB Indexing Techniques for Efficient Retrieval of Textual XML Data. ECIR 2004: 378-393 - [c9]Felix Weigel, Klaus U. Schulz, Holger Meuss:
Ranked Retrieval of Structured Documents with the S-Term Vector Space Model. INEX 2004: 238-252 - [c8]Felix Weigel, Holger Meuss, Klaus U. Schulz, François Bry:
Content and Structure in Indexing and Ranking XML. WebDB 2004: 67-72 - 2003
- [c7]Holger Meuss, Klaus U. Schulz, François Bry:
Visual Querying and Exploration of Large Answers in XML Databases with X2. ICDE 2003: 777-779 - 2002
- [j3]Torsten Schlieder, Holger Meuss:
Querying and ranking XML documents. J. Assoc. Inf. Sci. Technol. 53(6): 489-503 (2002) - [c6]Dan Olteanu, Holger Meuss, Tim Furche, François Bry:
XPath: Looking Forward. EDBT Workshops 2002: 109-127 - 2001
- [j2]Holger Meuss, Klaus U. Schulz:
Complete answer aggregates for treelike databases: a novel approach to combine querying and navigation. ACM Trans. Inf. Syst. 19(2): 161-215 (2001) - [c5]Holger Meuss, Klaus U. Schulz, François Bry:
Towards Aggregated Answers for Semistructured Data. ICDT 2001: 346-360 - 2000
- [b1]Holger Meuss:
Logical tree matching with complete answer aggregates for retrieving structured documents. Ludwig Maximilian University of Munich, Germany, dissertation.de 2000, ISBN 978-3-89825-109-9, pp. 1-210 - [c4]Torsten Schlieder, Holger Meuss:
Result Ranking for Structured Queries against XML Documents. DELOS 2000
1990 – 1999
- 1999
- [j1]Slim Abdennadher, Thom W. Frühwirth, Holger Meuss:
Confluence and Semantics of Constraint Simplification Rules. Constraints An Int. J. 4(2): 133-165 (1999) - [c3]Holger Meuss, Christian M. Strohmaier:
Improving Index Structures for Structured Document Retrieval. BCS-IRSG Annual Colloquium on IR Research 1999 - 1998
- [c2]Holger Meuss:
Indexed Tree Matching with Complete Answer Representations. PODDP 1998: 104-115 - 1996
- [c1]Slim Abdennadher, Thom W. Frühwirth, Holger Meuss:
On Confluence of Constraint Handling Rules. CP 1996: 1-15
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:48 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:
