Sciweavers

242 search results - page 28 / 49
» Fast Indexes and Algorithms for Set Similarity Selection Que...
Sort
View
IJCNN
2000
IEEE
13 years 11 months ago
Regression Analysis for Rival Penalized Competitive Learning Binary Tree
The main aim of this paper is to develop a suitable regression analysis model for describing the relationship between the index efficiency and the parameters of the Rival Penaliz...
Xuequn Li, Irwin King
SIGMOD
2010
ACM
166views Database» more  SIGMOD 2010»
13 years 5 months ago
Efficient two-sided error-tolerant search
We consider fast two-sided error-tolerant search that is robust against errors both on the query side (type alogrithm, find documents with algorithm) as well as on the document si...
Hannah Bast, Marjan Celikik
SIGMOD
2003
ACM
129views Database» more  SIGMOD 2003»
14 years 7 months ago
Efficient Processing of Joins on Set-valued Attributes
Object-oriented and object-relational DBMS support setvalued attributes, which are a natural and concise way to model complex information. However, there has been limited research...
Nikos Mamoulis
DATESO
2008
131views Database» more  DATESO 2008»
13 years 8 months ago
Towards Cost-based Optimizations of Twig Content-based Queries
Abstract In recent years, many approaches to indexing XML data have appeared. These approaches attempt to process XML queries efficiently and sufficient query plans are built for t...
Michal Krátký, Radim Baca
ADBIS
2006
Springer
166views Database» more  ADBIS 2006»
14 years 1 months ago
Clustering-Based Materialized View Selection in Data Warehouses
materialized view selection is a non-trivial task. Hence, its complexity must be reduced. A judicious choice of views must be costdriven and influenced by the workload experienced...
Kamel Aouiche, Pierre-Emmanuel Jouve, Jér&o...