Sciweavers

611 search results - page 94 / 123
» Querying Tree-Structured Data Using Dimension Graphs
Sort
View
ICWS
2009
IEEE
14 years 4 months ago
Service Provenance in QoS-Aware Web Service Runtimes
In general, provenance of electronic data represents an important issue in information systems. So far, Serviceoriented Computing research has mainly focused on provenance of data...
Anton Michlmayr, Florian Rosenberg, Philipp Leitne...
WAW
2010
Springer
312views Algorithms» more  WAW 2010»
13 years 5 months ago
The Geometric Protean Model for On-Line Social Networks
We introduce a new geometric, rank-based model for the link structure of on-line social networks (OSNs). In the geo-protean (GEO-P) model for OSNs nodes are identified with points ...
Anthony Bonato, Jeannette Janssen, Pawel Pralat
ICDE
2002
IEEE
138views Database» more  ICDE 2002»
14 years 9 months ago
Efficient Temporal Join Processing Using Indices
We examine the problem of processing temporal joins in the presence of indexing schemes. Previous work on temporal joins has concentrated on non-indexed relations which were fully...
Donghui Zhang, Vassilis J. Tsotras, Bernhard Seege...
EDBT
2010
ACM
135views Database» more  EDBT 2010»
14 years 2 months ago
Region-based online promotion analysis
This paper addresses a fundamental and challenging problem with broad applications: efficient processing of region-based promotion queries, i.e., to discover the top-k most inter...
Tianyi Wu, Yizhou Sun, Cuiping Li, Jiawei Han
INFOCOM
2006
IEEE
14 years 1 months ago
Theory and Network Applications of Dynamic Bloom Filters
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
Deke Guo, Jie Wu, Honghui Chen, Xueshan Luo