Sciweavers

735 search results - page 105 / 147
» Evaluating Probabilistic Queries over Imprecise Data
Sort
View
IDEAS
2000
IEEE
96views Database» more  IDEAS 2000»
15 years 4 months ago
A Cost Function for Uniformly Partitioned UB-Trees
Most operations of the relational algebra or SQL - like projection with duplicate elimination, join, ordering, group by and aggregations - are efficiently processed using a sorted...
Volker Markl, Rudolf Bayer
ASUNAM
2010
IEEE
15 years 1 months ago
COSI: Cloud Oriented Subgraph Identification in Massive Social Networks
Subgraph matching is a key operation on graph data. Social network (SN) providers may want to find all subgraphs within their social network that "match" certain query gr...
Matthias Bröcheler, Andrea Pugliese, V. S. Su...
RIAO
2004
15 years 1 months ago
Information retrieval on mixed written and spoken documents
While advances have been made in structuring, indexing and retrieval of multimedia documents, we propose to study the unexplored problematics of information retrieval on heterogen...
Benoît Favre, Patrice Bellot, Jean-Fran&cced...
PVLDB
2010
122views more  PVLDB 2010»
14 years 10 months ago
On Graph Query Optimization in Large Networks
The dramatic proliferation of sophisticated networks has resulted in a growing need for supporting effective querying and mining methods over such large-scale graph-structured da...
Peixiang Zhao, Jiawei Han
ICDE
2007
IEEE
174views Database» more  ICDE 2007»
15 years 6 months ago
Adapting Partitioned Continuous Query Processing in Distributed Systems
Partitioned query processing is an effective method to process continuous queries with large stateful operators in a distributed systems. This method typically partitions input da...
Yali Zhu, Elke A. Rundensteiner