Sciweavers

2070 search results - page 352 / 414
» Querying Communities in Relational Databases
Sort
View
SPAA
2009
ACM
15 years 11 months ago
On randomized representations of graphs using short labels
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
Pierre Fraigniaud, Amos Korman
ICIP
2006
IEEE
16 years 18 days ago
On the Use of Metrics for Multi-Dimensional Descriptors Clustering
The Visual Thesaurus is a new query approach when no starting image is available. It is a concise representation of all similar regions in a panel of visual patches; the user arra...
Hichem Houissa, Nozha Boujemaa
SIGMOD
2003
ACM
196views Database» more  SIGMOD 2003»
15 years 11 months ago
Spreadsheets in RDBMS for OLAP
One of the critical deficiencies of SQL is lack of support for ndimensional array-based computations which are frequent in OLAP environments. Relational OLAP (ROLAP) applications ...
Andrew Witkowski, Srikanth Bellamkonda, Tolga Bozk...
PODS
2003
ACM
143views Database» more  PODS 2003»
15 years 11 months ago
Maintaining variance and k-medians over data stream windows
The sliding window model is useful for discounting stale data in data stream applications. In this model, data elements arrive continually and only the most recent N elements are ...
Brian Babcock, Mayur Datar, Rajeev Motwani, Liadan...
VLDB
2005
ACM
122views Database» more  VLDB 2005»
15 years 4 months ago
C-Store: A Column-oriented DBMS
This paper presents the design of a read-optimized relational DBMS that contrasts sharply with most current systems, which are write-optimized. Among the many differences in its d...
Michael Stonebraker, Daniel J. Abadi, Adam Batkin,...