Sciweavers

1521 search results - page 171 / 305
» The Stardinates - Visualizing Highly Structured Data
Sort
View
ICDM
2002
IEEE
123views Data Mining» more  ICDM 2002»
15 years 11 months ago
Towards Automatic Generation of Query Taxonomy: A Hierarchical Query Clustering Approach
Previous works on automatic query clustering most generate a flat, un-nested partition of query terms. In this work, we are pursuing to organize query terms into a hierarchical s...
Shui-Lung Chuang, Lee-Feng Chien
DASFAA
1999
IEEE
84views Database» more  DASFAA 1999»
15 years 10 months ago
P-Tree: A B-Tree Index for Lists
The high frequency of applications involving large, ordered, nested lists suggests that list is the "next most" natural data type after set. A list differs from a set th...
Ke Wang, Beng Chin Ooi, Sam Yuan Sung
VRML
1998
ACM
15 years 10 months ago
Building OpenWorlds
This paper discusses the history and design decisions behind OpenWorlds, the first C++ toolkit for VRML 2.0 integration. OpenWorlds is a highly extensible set of libraries which s...
Paul J. Diefenbach, Prakash Mahesh, Daniel Hunt
ESA
1998
Springer
169views Algorithms» more  ESA 1998»
15 years 10 months ago
Augmenting Suffix Trees, with Applications
Information retrieval and data compression are the two main application areas where the rich theory of string algorithmics plays a fundamental role. In this paper, we consider one ...
Yossi Matias, S. Muthukrishnan, Süleyman Cenk...
VLDB
1987
ACM
93views Database» more  VLDB 1987»
15 years 9 months ago
FAD, a Powerful and Simple Database Language
FAD is a powerful and simple language designed for a highly parallel database machine. The basic concepts of the language are its data structures (which we call objects) and its p...
François Bancilhon, Ted Briggs, Setrag Khos...