Sciweavers

513 search results - page 39 / 103
» Cache Conscious Algorithms for Relational Query Processing
Sort
View
160
Voted
SIGMOD
2006
ACM
159views Database» more  SIGMOD 2006»
15 years 9 months ago
Flexible and efficient XML search with complex full-text predicates
Recently, there has been extensive research that generated a wealth of new XML full-text query languages, ranging from simple Boolean search to combining sophisticated proximity a...
Sihem Amer-Yahia, Emiran Curtmola, Alin Deutsch
DATESO
2009
158views Database» more  DATESO 2009»
14 years 7 months ago
Benchmarking Coding Algorithms for the R-tree Compression
Multi-dimensional data structures have been widely applied in many data management fields. Spatial data indexing is their natural application, however there are many applications i...
Jirí Walder, Michal Krátký, R...
ICDE
2005
IEEE
86views Database» more  ICDE 2005»
15 years 11 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
107
Voted
ADVIS
2004
Springer
15 years 3 months ago
Incremental Association Rule Mining Using Materialized Data Mining Views
Data mining is an interactive and iterative process. Users issue series of similar queries until they receive satisfying results, yet currently available data mining systems do not...
Mikolaj Morzy, Tadeusz Morzy, Zbyszko Króli...
91
Voted
SSDBM
2003
IEEE
136views Database» more  SSDBM 2003»
15 years 2 months ago
Acceleration of Relational Index Structures Based on Statistics
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existin...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...