Sciweavers

131 search results - page 18 / 27
» Linear Constraint Query Languages: Expressive Power and Comp...
Sort
View
ICDT
2001
ACM
131views Database» more  ICDT 2001»
14 years 2 days ago
Query Evaluation via Tree-Decompositions
A number of efficient methods for evaluating first-order and monadic-second order queries on finite relational structures are based on tree-decompositions of structures or quer...
Jörg Flum, Markus Frick, Martin Grohe
JACM
2000
81views more  JACM 2000»
13 years 7 months ago
Relational queries over interpreted structures
We rework parts of the classical relational theory when the underlying domain is a structure with some interpreted operations that can be used in queries. We identify parts of the...
Michael Benedikt, Leonid Libkin
ICDT
2010
ACM
161views Database» more  ICDT 2010»
14 years 5 months ago
Composition with Target Constraints
It is known that the composition of schema mappings, each specified by source-to-target tgds (st-tgds), can be specified by a secondorder tgd (SO tgd). We consider the question of...
Marcelo Arenas, Ronald Fagin, Alan Nash
SDM
2009
SIAM
193views Data Mining» more  SDM 2009»
14 years 4 months ago
Agglomerative Mean-Shift Clustering via Query Set Compression.
Mean-Shift (MS) is a powerful non-parametric clustering method. Although good accuracy can be achieved, its computational cost is particularly expensive even on moderate data sets...
Xiaotong Yuan, Bao-Gang Hu, Ran He
ECIR
2009
Springer
13 years 5 months ago
Refining Keyword Queries for XML Retrieval by Combining Content and Structure
Abstract. The structural heterogeneity and complexity of XML repositories makes query formulation challenging for users who have little knowledge of XML. To assist its users, an XM...
Desislava Petkova, W. Bruce Croft, Yanlei Diao