Sciweavers

3020 search results - page 196 / 604
» Similarity Queries on Structured Data in Structured Overlays
Sort
View
COMPGEOM
2009
ACM
16 years 1 months ago
Cache-oblivious range reporting with optimal queries requires superlinear space
We consider a number of range reporting problems in two and three dimensions and prove lower bounds on the amount of space used by any cache-oblivious data structure for these pro...
Peyman Afshani, Chris H. Hamilton, Norbert Zeh
KDD
2002
ACM
197views Data Mining» more  KDD 2002»
16 years 7 months ago
SimRank: a measure of structural-context similarity
The problem of measuring "similarity" of objects arises in many applications, and many domain-specific measures have been developed, e.g., matching text across documents...
Glen Jeh, Jennifer Widom
KDD
2007
ACM
227views Data Mining» more  KDD 2007»
16 years 7 months ago
Fast best-effort pattern matching in large attributed graphs
We focus on large graphs where nodes have attributes, such as a social network where the nodes are labelled with each person's job title. In such a setting, we want to find s...
Hanghang Tong, Christos Faloutsos, Brian Gallagher...
CACM
2010
161views more  CACM 2010»
15 years 5 months ago
Efficiently searching for similar images
As it becomes increasingly viable to capture, store, and share large amounts of image and video data, automatic image analysis is crucial to managing visual information. Many prob...
Kristen Grauman
SIGMOD
2009
ACM
172views Database» more  SIGMOD 2009»
16 years 1 months ago
Self-organizing tuple reconstruction in column-stores
Column-stores gained popularity as a promising physical design alternative. Each attribute of a relation is physically stored as a separate column allowing queries to load only th...
Stratos Idreos, Martin L. Kersten, Stefan Manegold