Sciweavers

2070 search results - page 52 / 414
» Querying Communities in Relational Databases
Sort
View
WWW
2005
ACM
15 years 11 months ago
Partitioning of Web graphs by community topology
We introduce a stricter Web community definition to overcome boundary ambiguity of a Web community defined by Flake, Lawrence and Giles [2], and consider the problem of finding co...
Hidehiko Ino, Mineichi Kudo, Atsuyoshi Nakamura
63
Voted
VLDB
2005
ACM
93views Database» more  VLDB 2005»
15 years 4 months ago
The TEXTURE Benchmark: Measuring Performance of Text Queries on a Relational DBMS
We introduce a benchmark called TEXTURE (TEXT Under RElations) to measure the relative strengths and weaknesses of combining text processing with a relational workload in an RDBMS...
Vuk Ercegovac, David J. DeWitt, Raghu Ramakrishnan
ISMIS
2003
Springer
15 years 4 months ago
NETMARK: A Schema-Less Extension for Relational Databases for Managing Semi-structured Data Dynamically
Object-Relational database management system is an integrated hybrid cooperative approach to combine the best practices of both the relational model utilizing SQL queries and the ...
David A. Maluf, Peter B. Tran
ICDE
1999
IEEE
89views Database» more  ICDE 1999»
16 years 7 days ago
Relative Prefix Sums: An Efficient Approach for Querying Dynamic OLAP Data Cubes
Range sum queries on data cubes are a powerful tool for analysis. A range sum query applies an aggregation operation (e.g., SUM) over all selected cells in a data cube, where the ...
Steven Geffner, Divyakant Agrawal, Amr El Abbadi, ...
82
Voted
MM
2004
ACM
151views Multimedia» more  MM 2004»
15 years 4 months ago
Affinity relation discovery in image database clustering and content-based retrieval
In this paper, we propose a unified framework, called Markov Model Mediator (MMM), to facilitate image database clustering and to improve the query performance. The structure of t...
Mei-Ling Shyu, Shu-Ching Chen, Min Chen, Chengcui ...