Computing arbitrary functions of encrypted data

C Gentry - Communications of the ACM, 2010 - dl.acm.org
Suppose that you want to delegate the ability to process your data, without giving away
access to it. We show that this separation is possible: we describe a" fully homomorphic" …

A survey on tree matching and XML retrieval

MA Tahraoui, K Pinel-Sauvagnat, C Laitang… - Computer Science …, 2013 - Elsevier
With the increasing number of available XML documents, numerous approaches for retrieval
have been proposed in the literature. They usually use the tree representation of documents …

A probabilistic retrieval model for semistructured data

J Kim, X Xue, WB Croft - Advances in Information Retrieval: 31th European …, 2009 - Springer
Retrieving semistructured (XML) data typically requires either a structured query such as
XPath, or a keyword query that does not take structure into account. In this paper, we infer …

Supporting top-k keyword search in xml databases

LJ Chen, Y Papakonstantinou - 2010 IEEE 26th International …, 2010 - ieeexplore.ieee.org
Keyword search is considered to be an effective information discovery method for both
structured and semi-structured data. In XML keyword search, query semantics is based on …

Language-model-based ranking for queries on RDF-graphs

S Elbassuoni, M Ramanath, R Schenkel… - Proceedings of the 18th …, 2009 - dl.acm.org
The success of knowledge-sharing communities like Wikipedia and the advances in
automatic information extraction from textual and Web sources have made it possible to …

TopX: efficient and versatile top-k query processing for semistructured data

M Theobald, H Bast, D Majumdar, R Schenkel… - The VLDB Journal, 2008 - Springer
Recent IR extensions to XML query languages such as Xpath 1.0 Full-Text or the NEXI
query language of the INEX benchmark series reflect the emerging interest in IR-style …

Mímir: An open-source semantic search framework for interactive information seeking and discovery

V Tablan, K Bontcheva, I Roberts… - Journal of Web …, 2015 - Elsevier
Semantic search is gradually establishing itself as the next generation search paradigm,
which meets better a wider range of information needs, as compared to traditional full-text …

Predicting web searcher satisfaction with existing community-based answers

Q Liu, E Agichtein, G Dror, E Gabrilovich… - Proceedings of the 34th …, 2011 - dl.acm.org
Community-based Question Answering (CQA) sites, such as Yahoo! Answers, Baidu Knows,
Naver, and Quora, have been rapidly growing in popularity. The resulting archives of posted …

[PDF][PDF] Searching RDF graphs with SPARQL and keywords.

S Elbassuoni, M Ramanath, R Schenkel, G Weikum - IEEE Data Eng. Bull., 2010 - Citeseer
The proliferation of knowledge-sharing communities like Wikipedia and the advances in
automated information extraction from Web pages enable the construction of large …

Query relaxation for entity-relationship search

S Elbassuoni, M Ramanath, G Weikum - … , Crete, Greece, May 29–June 2 …, 2011 - Springer
Entity-relationship-structured data is becoming more important on the Web. For example,
large knowledge bases have been automatically constructed by information extraction from …