Sciweavers

1888 search results - page 168 / 378
» Algorithms for Querying by Spatial Structure
Sort
View
ADBIS
2007
Springer
119views Database» more  ADBIS 2007»
16 years 1 months ago
Combining Efficient XML Compression with Query Processing
This paper describes a new XML compression scheme that offers both high compression ratios and short query response time. Its core is a fully reversible transform featuring substit...
Przemyslaw Skibinski, Jakub Swacha
SAC
2009
ACM
15 years 11 months ago
Discovering XML keys and foreign keys in queries
The XML has undoubtedly become a standard for data representation and manipulation. But most of XML documents are still created without the respective description of their structu...
Martin Necaský, Irena Mlýnková...
CIKM
2008
Springer
15 years 9 months ago
A latent variable model for query expansion using the hidden markov model
We propose a novel probabilistic method based on the Hidden Markov Model (HMM) to learn the structure of a Latent Variable Model (LVM) for query language modeling. In the proposed...
Qiang Huang, Dawei Song
CCCG
2008
15 years 8 months ago
Smallest enclosing circle centered on a query line segment
Given a set of n points P = {p1, p2, . . . , pn} in the plane, we show how to preprocess P such that for any query line segment L we can report in O(log n) time the smallest enclo...
Prosenjit Bose, Stefan Langerman, Sasanka Roy
SIGMOD
2009
ACM
111views Database» more  SIGMOD 2009»
16 years 7 months ago
Language-model-based ranking in entity-relation graphs
We propose a language-model-based ranking approach for SPARQLlike queries on entity-relationship graphs. Our ranking model supports exact matching, approximate structure matching,...
Shady Elbassuoni, Maya Ramanath, Gerhard Weikum