Sciweavers

552 search results - page 52 / 111
» Efficient Algorithms for Processing XPath Queries
Sort
View
BDA
2006
15 years 4 months ago
Matching Algorithms for User Notification in Digital Libraries
We consider a publish/subscribe system for digital libraries which continuously evaluates queries over a large repository containing document descriptions. The subscriptions, the ...
Hanen Belhaj Frej, Philippe Rigaux, Nicolas Spyrat...
ICDE
2005
IEEE
86views Database» more  ICDE 2005»
16 years 4 months ago
Personalized Queries under a Generalized Preference Model
Query Personalization is the process of dynamically enhancing a query with related user preferences stored in a user profile with the aim of providing personalized answers. The un...
Georgia Koutrika, Yannis E. Ioannidis
SIGIR
2000
ACM
15 years 7 months ago
Hill climbing algorithms for content-based retrieval of similar configurations
The retrieval of stored images matching an input configuration is an important form of content-based retrieval. Exhaustive processing (i.e., retrieval of the best solutions) of co...
Dimitris Papadias
DAWAK
1999
Springer
15 years 7 months ago
Efficient Bulk Loading of Large High-Dimensional Indexes
Efficient index construction in multidimensional data spaces is important for many knowledge discovery algorithms, because construction times typically must be amortized by perform...
Christian Böhm, Hans-Peter Kriegel
VLDB
2004
ACM
119views Database» more  VLDB 2004»
16 years 3 months ago
Evaluating holistic aggregators efficiently for very large datasets
Indatawarehousingapplications,numerousOLAP queries involve the processing of holistic aggregators such as computing the "top n," median, quantiles, etc. In this paper, we...
Lixin Fu, Sanguthevar Rajasekaran