Sciweavers

1042 search results - page 51 / 209
» Constraint Databases, Data Structures and Efficient Query Ev...
Sort
View
ADL
2000
Springer
251views Digital Library» more  ADL 2000»
15 years 7 months ago
Efficient Similarity Search in Digital Libraries
Digital libraries are a core information technology. When the stored data is complex, e.g. high-resolution images or molecular protein structures, simple query types like the exac...
Christian Böhm, Bernhard Braunmüller, Ha...
117
Voted
ICDE
2007
IEEE
119views Database» more  ICDE 2007»
15 years 9 months ago
Practical Preference Relations for Large Data Sets
User-defined preferences allow personalized ranking of query results. A user provides a declarative specification of his/her preferences, and the system is expected to use that ...
Kenneth A. Ross, Peter J. Stuckey, Amélie M...
128
Voted
ICDE
2010
IEEE
262views Database» more  ICDE 2010»
16 years 2 months ago
Approximate String Search in Spatial Databases
Abstract-- This work presents a novel index structure, MHRtree, for efficiently answering approximate string match queries in large spatial databases. The MHR-tree is based on the ...
Bin Yao, Feifei Li, Marios Hadjieleftheriou, Kun H...
107
Voted
SAC
2009
ACM
15 years 9 months ago
Building an efficient preference XML query processor
Today user-centered information acquisition over collections of complex XML documents is increasingly in demand. To this end, preferences have become an important paradigm enablin...
SungRan Cho, Wolf-Tilo Balke
139
Voted
ADBIS
2006
Springer
165views Database» more  ADBIS 2006»
15 years 6 months ago
Fragmenting XML Documents via Structural Constraints
Abstract. XML query processors suffer from main-memory limitations that prevent them from processing large XML documents. While content-based predicates can be used to project down...
Angela Bonifati, Alfredo Cuzzocrea, Bruno Zinno