Sciweavers

5451 search results - page 970 / 1091
» On very high degrees
Sort
View
SIGMOD
2002
ACM
169views Database» more  SIGMOD 2002»
14 years 9 months ago
Covering indexes for branching path queries
In this paper, we ask if the traditional relational query acceleration techniques of summary tables and covering indexes have analogs for branching path expression queries over tr...
Raghav Kaushik, Philip Bohannon, Jeffrey F. Naught...
PODS
2003
ACM
156views Database» more  PODS 2003»
14 years 9 months ago
Limiting privacy breaches in privacy preserving data mining
There has been increasing interest in the problem of building accurate data mining models over aggregate data, while protecting privacy at the level of individual records. One app...
Alexandre V. Evfimievski, Johannes Gehrke, Ramakri...
PODS
2006
ACM
134views Database» more  PODS 2006»
14 years 9 months ago
Finding global icebergs over distributed data sets
Finding icebergs ? items whose frequency of occurrence is above a certain threshold ? is an important problem with a wide range of applications. Most of the existing work focuses ...
Qi Zhao, Mitsunori Ogihara, Haixun Wang, Jun Xu
EDBT
2006
ACM
174views Database» more  EDBT 2006»
14 years 9 months ago
Fast Computation of Reachability Labeling for Large Graphs
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
Jiefeng Cheng, Jeffrey Xu Yu, Xuemin Lin, Haixun W...
EDBT
2008
ACM
132views Database» more  EDBT 2008»
14 years 9 months ago
Indexing high-dimensional data in dual distance spaces: a symmetrical encoding approach
Due to the well-known dimensionality curse problem, search in a high-dimensional space is considered as a "hard" problem. In this paper, a novel symmetrical encoding-bas...
Yi Zhuang, Yueting Zhuang, Qing Li, Lei Chen 0002,...