Many enterprise applications prefer to store XML data as a rich data type, i.e. a sequence of bytes, in a relational database system to avoid the complexity of decomposing the data into a large number of tables and the cost of reassembling the XML data. The upcoming release of Microsoft’s SQL Server supports XQuery as the query language over such XML data using its relational infrastructure. XQ...

several semantic image search schemes have been recently proposed to retrieve images from the web. however, the query context is regularly ignored in these techniques and hence, many of the returned images are not adequately relevant. in this paper, we make use of context to further confine the outcome of the semantic search engines. for this purpose, we propose a hybrid search engine which uti...

This paper provides a decentralized data model and associated algorithms for peer data management systems (PDMSs) based on the DL-LITER description logic. That logic is a fragment of the forthcoming W3C recommendation for the Semantic Web : OWL2. Our approach relies on reducing query reformulation and consistency checking for DL-LITER into reasoning in propositional logic. This enables a straig...

In this work we propose a comparative study of the effects of a continuous model update on the effectiveness of wellknown query recommendation algorithms. In their original formulation, these algorithms use static (i.e. pre-computed) models to generate recommendations. We extend these algorithms to generate suggestions using: a static model (no updates), a model updated periodically, and a mode...

Research on Recommender Systems has barely explored the issue of adapting a recommendation strategy to the user’s information available at a certain time. In this thesis, we introduce a component that allows building dynamic recommendation strategies, by reformulating the performance prediction problem in the area of Information Retrieval to that of recommender systems. More specifically, we in...

To build a fashion recommendation system, we need to help users retrieve fashionable items that are visually similar to a particular query, for reasons ranging from searching alternatives (i.e., substitutes), to generating stylish outfits that are visually consistent, among other applications. In domains like clothing and accessories, such considerations are particularly paramount as the visual...

A search query, being a very concise grounding of user intent, could potentially have many possible interpretations. Search engines hedge their bets by diversifying top results to cover multiple such possibilities so that the user is likely to be satisfied, whatever be her intended interpretation. Diversified Query Expansion is the problem of diversifying query expansion suggestions, so that th...

Database access logs are the canonical go-to resource for tasks ranging from performance tuning to security auditing. Unfortunately, they are also large, unwieldy, and it can be difficult for a human analyst to divine the intent behind typical queries in the log. With an eye towards creating tools for ad-hoc exploration of queries by intent, we analyze techniques for clustering queries by inten...

Query auto completion is known to provide poor predictions of the user’s query when her input prefix is very short (e.g., one or two characters). In this paper we show that context, such as the user’s recent queries, can be used to improve the prediction quality considerably even for such short prefixes. We propose a context-sensitive query auto completion algorithm, NearestCompletion, which ou...

The W3C Generating RDF from Tabular Data on the Web Recommendation provides a mechanism for mapping CSV-formatted data to any graph model. Since Wikibase model used by Wikidata can be expressed as RDF, this document tabular snapshots of parts knowledge in simple form that is easy humans and applications read. Those how subgraphs have changed over time compared with current state using its Query...