Sciweavers

664 search results - page 12 / 133
» Generalized Search Trees for Database Systems
Sort
View
EDBT
2000
ACM
15 years 7 months ago
Mining Classification Rules from Datasets with Large Number of Many-Valued Attributes
Decision tree induction algorithms scale well to large datasets for their univariate and divide-and-conquer approach. However, they may fail in discovering effective knowledge when...
Giovanni Giuffrida, Wesley W. Chu, Dominique M. Ha...
VLDB
1997
ACM
141views Database» more  VLDB 1997»
15 years 8 months ago
Efficient User-Adaptable Similarity Search in Large Multimedia Databases
Efficient user-adaptable similarity search more and more increases in its importance for multimedia and spatial database systems. As a general similarity model for multi-dimension...
Thomas Seidl, Hans-Peter Kriegel
JAL
2002
113views more  JAL 2002»
15 years 3 months ago
A multivariate view of random bucket digital search trees
We take a multivariate view of digital search trees by studying the number of nodes of different types that may coexist in a bucket digital search tree as it grows under an arbitr...
Friedrich Hubalek, Hsien-Kuei Hwang, William Lew, ...
XIMEP
2005
ACM
174views Database» more  XIMEP 2005»
15 years 9 months ago
NaXDB - Realizing Pipelined XQuery Processing in a Native XML Database System
Supporting queries and modifications on XML documents is a challenging task, and several related approaches exist. When implementing query and modification languages efficientl...
Jens Hündling, Jan Sievers, Mathias Weske
115
Voted
ICDE
2006
IEEE
97views Database» more  ICDE 2006»
15 years 10 months ago
Measuring Generality of Documents
Most traditional Information Retrieval (IR) systems, including web search engines, operationalize “relevant” as the word frequency in a document of a set of keywords. Because ...
Hyun Woong Shin, Eduard H. Hovy, Dennis McLeod, La...