EDBT 2009 - PDF Preprint Papers

EDBT 2009 International Conference on Extending Database Technology

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed EDBT-2009 Paper

click to vote

EDBT
2009
ACM

302views Database» more EDBT 2009»

RankClus: integrating clustering with ranking for heterogeneous information network analysis

14 years 6 months ago

Download www.se.cuhk.edu.hk

As information networks become ubiquitous, extracting knowledge from information networks has become an important task. Both ranking and clustering can provide overall views on in...

Yizhou Sun, Jiawei Han, Peixiang Zhao, Zhijun Yin,...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	302	RankClus: integrating clustering with ranking for heterogeneous information network analysis	claim
2	277	G-hash: towards fast kernel-based similarity search in large graph databases	claim
3	241	GADDI: distance index based subgraph matching in biological networks	claim
4	222	Data clouds: summarizing keyword search results over structured data	claim
5	218	Data integration flows for business intelligence	claim
6	208	Flexible and efficient querying and ranking on hyperlinked data sources	claim
7	207	Evaluating probability threshold k-nearest-neighbor queries over uncertain data	claim
8	200	Continuous privacy preserving publishing of data streams	claim
9	195	Anonymizing moving objects: how to hide a MOB in a crowd?	claim
10	186	Automating the loading of business process data warehouses	claim
11	184	Distributed similarity search in high dimensions using locality sensitive hashing	claim
12	175	Towards materialized view selection for distributed databases	claim
13	174	Continuous probabilistic nearest-neighbor queries for uncertain trajectories	claim
14	173	PROUD: a probabilistic approach to processing similarity queries over uncertain data streams	claim
15	172	Continuous visible nearest neighbor queries	claim
16	170	Efficient constraint evaluation in categorical sequential pattern mining for trajectory databases	claim
17	169	Xoom: a tool for zooming in and out of XML documents	claim
18	166	Shore-MT: a scalable storage manager for the multicore era	claim
19	166	Neighbor-based pattern detection for windows over streaming data	claim
20	165	Exploiting the power of relational databases for efficient stream processing	claim
21	164	Fast object search on road networks	claim
22	164	Efficient identification of starters and followers in social media	claim
23	162	A data model for trip planning in multimodal transportation systems	claim
24	160	Estimating aggregates in time-constrained approximate queries in Oracle	claim
25	158	CourseCloud: summarizing and refining keyword searches over structured data	claim
26	158	An approach to detecting relevant updates to cached data using XML and active databases	claim
27	156	Evaluating very large datalog queries on social networks	claim
28	156	Secondary bitmap indexes with vertical and horizontal partitioning	claim
29	156	Efficient skyline retrieval with arbitrary similarity measures	claim
30	152	On-line exact shortest distance query processing	claim
31	149	Towards integrated and efficient scientific sensor data processing: a database approach	claim
32	148	MVT: a schema mapping validation tool	claim
33	145	Interactive query refinement	claim
34	145	Efficient top-k count queries over imprecise duplicates	claim
35	145	An efficient online auditing approach to limit private data disclosure	claim
36	144	Efficient maintenance techniques for views over active documents	claim
37	138	FOGGER: an algorithm for graph generator discovery	claim
38	137	Flexible and scalable storage management for data-intensive stream processing	claim
39	136	On the comparison of microdata disclosure control algorithms	claim
40	136	Rule-based multi-query optimization	claim
41	136	Finding frequent co-occurring terms in relational keyword search	claim
42	135	Provenance for nested subqueries	claim
43	134	Caching content-based queries for robust and efficient image retrieval	claim
44	133	Multiplicative synopses for relative-error metrics	claim
45	133	Schema-conscious filtering of XML documents	claim
46	132	A novel approach for efficient supergraph query processing on graph databases	claim
47	131	Sample synopses for approximate answering of group-by queries	claim
48	128	HIDE: heterogeneous information DE-identification	claim
49	127	Answering aggregate keyword queries on relational databases using minimal group-bys	claim
50	127	Approximate substring selectivity estimation	claim
51	126	A tool for mapping discovery over revealing schemas	claim
52	124	A sequential indexing scheme for flash-based embedded systems	claim
53	124	Processing probabilistic spatio-temporal range queries over moving objects with uncertainty	claim
54	123	High-performance information extraction with AliBaba	claim
55	122	Hiding distinguished ones into crowd: privacy-preserving publishing data with outliers	claim
56	122	Finding the influence set through skylines	claim
57	121	MarcoPolo: a community system for sharing and integrating travel information on maps	claim
58	120	Retrieving meaningful relaxed tightest fragments for XML keyword search	claim
59	119	Unrestricted wavelet synopses under maximum error bound	claim
60	118	Optimized union of non-disjoint distributed data sets	claim
61	118	Flexible query answering on graph-modeled data	claim
62	118	Flower-CDN: a hybrid P2P overlay for efficient query processing in CDN	claim
63	117	Parsimonious temporal aggregation	claim
64	117	A methodology for preference-based personalization of contextual data	claim
65	116	Ranking objects based on relationships and fixed associations	claim
66	115	Top-k dominating queries in uncertain databases	claim
67	114	Sequenced spatio-temporal aggregation in road networks	claim
68	113	Query ranking in probabilistic XML data	claim
69	113	Supporting annotations on relations	claim
70	113	Type-based categorization of relational attributes	claim
71	112	GCIP: exploiting the generation and optimization of integration processes	claim
72	111	Detecting privacy violations in database publishing using disjoint queries	claim
73	110	A sampling approach for XML query selectivity estimation	claim
74	109	Estimating the number of frequent itemsets in a large database	claim
75	109	Managing long-running queries	claim
76	108	Reverse k-nearest neighbor search in dynamic and general metric databases	claim
77	108	It takes variety to make a world: diversification in recommender systems	claim
78	106	AlphaSum: size-constrained table summarization using value lattices	claim
79	105	Personalizing entity detection and recommendation with a fusion of web log mining techniques	claim
80	104	A query processor for prediction-based monitoring of data streams	claim
81	104	Fair, effective, efficient and differentiated scheduling in an enterprise data warehouse	claim
82	102	On keys, foreign keys and nullable attributes in relational mapping systems	claim
83	100	A view selection algorithm with performance guarantee	claim
84	100	Efficiently indexing shortest paths by exploiting symmetry in graphs	claim
85	100	Self-tuning query mesh for adaptive multi-route query processing	claim
86	98	Time-completeness trade-offs in record linkage using adaptive query processing	claim
87	98	A runtime approach to model-independent schema and data translation	claim
88	96	Top-k dominant web services under multi-criteria matching	claim
89	95	Workload-aware data partitioning in community-driven data grids	claim
90	92	NNexus: an automatic linker for collaborative web-based corpora	claim
91	92	Indexing density models for incremental learning and anytime classification on data streams	claim
92	92	Efficient skyline computation in metric space	claim
93	90	Privacy-preserving data mashup	claim
94	90	Parallelization of XPath queries using multi-core processors: challenges and experiences	claim
95	85	Recursion in XQuery: put your distributivity safety belt on	claim
96	85	Expressive, yet tractable XML keys	claim
97	81	On rewriting XPath queries using views	claim
98	81	Exploiting similarity-aware grouping in decision support systems	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers