In this article, Macleod examines the suitability of the relational model in the context of storing and retrieving documents. The relational model is compared with other traditional models and their strengths and weaknesses are compared. Through out the article, Macleod largely compares the relational model against the text model. He states that ‘the terminology text model is used to refer to i...

We propose a new result that simplifies the evaluation of the marginal likelihood in Gaussian Structural Time Series (STS) models. For this we exploit the statistical properties of STS models and a theorem in Dickey (1968) to obtain the likelihood marginally to all variance parameters. Our strategy applies under inverted gamma-2 prior distributions for the structural shocks variances. In genera...

For improved cross section measurements of the reaction Cða; gÞO in inverted kinematics, a recoil separator ERNA is developed at the 4MV Dynamitron tandem accelerator in Bochum to detect directly the O recoils with high efficiency. The O recoils are produced by the C projectiles in a windowless He gas target. We report on the charge state distribution of the O recoils, the gas target density, t...

As a large number of corpuses are represented, stored and published in XML format, how to find useful information from XML databases has become an increasingly important issue. Keyword search enables web users to easily access XML data without the need to learn a structured query language or to study complex data schemas. Most existing indexing strategies for XML keyword search are based upon D...

Today’s search engines are increasingly required to broaden their capabilities beyond free-text search. More complex features, such as supporting range constraints over numeric data, are becoming common; structured search over XML data will soon follow. This is particularly true in the enterprise search domain, where engines attempt to integrate data from the Web and corporate knowledge portals...

We show that a HYB index can be constructed twice as fast as an ordinary inverted index. As shown in a series of recent works, the HYB index enables very fast prefix searches, which in turn is the basis for fast processing of many other types of advanced queries, including autocompletion, faceted search, synonym search, errortolerant search etc. HYB can be viewed as a “half-inverted index“ and ...

Data variety, as one of the three Vs of the Big Data, is man-ifested by a growing number of complex data types such asdocuments, sequences, trees, graphs and high dimensionalvectors. To perform similarity search on these data, exist-ing works mainly choose to create customized indexes fordifferent data types. Due to the diversity of customized in-dexes, it is hard to dev...

Selective search is a distributed retrieval architecture that intentionally creates skewed postings and access patterns. This work shows that the well-known QtfDf inverted list caching algorithm is as effective with topicallypartitioned indexes as it is with randomly-partitioned indexes. It also shows that a mixed global-local strategy reduces total I/O without harming query hit rates.

This work addresses the problem of billion-scale nearest neighbor search. The state-of-the-art retrieval systems for billion-scale databases are currently based on the inverted multi-index[2], the recently proposed generalization of the inverted index structure. The multi-index provides a very fine-grained partition of the feature space that allows extracting concise and accurate short-lists of...

In this paper, we solve the gait planning problem by using the Flexible LIP model, which has been shown to be more realistic w.r.t. the LIP for cost-effective or compliant biped robots for gait generation. We extend a stable inversion approach to obtain bounded Center of Mass (CoM) reference trajectories and show several advantages compared to preview control: avoidance of numerical integration...