Sciweavers

613 search results - page 17 / 123
» Query Evaluation on a Database Given by a Random Graph
Sort
View
ICDE
2009
IEEE
133views Database» more  ICDE 2009»
15 years 4 months ago
STAR: Steiner-Tree Approximation in Relationship Graphs
— Large graphs and networks are abundant in modern information systems: entity-relationship graphs over relational data or Web-extracted entities, biological networks, social onl...
Gjergji Kasneci, Maya Ramanath, Mauro Sozio, Fabia...
ICDE
2009
IEEE
129views Database» more  ICDE 2009»
15 years 11 months ago
Evaluating TOP-K Queries over Business Processes
A Business Process (BP) consists of some business activities undertaken by one or more organizations in pursuit of some business goal. Tools for querying and analyzing BP specifica...
Daniel Deutch, Tova Milo
ICDE
2006
IEEE
179views Database» more  ICDE 2006»
15 years 11 months ago
Distributed Evaluation of Continuous Equi-join Queries over Large Structured Overlay Networks
We study the problem of continuous relational query processing in Internet-scale overlay networks realized by distributed hash tables. We concentrate on the case of continuous two...
Stratos Idreos, Christos Tryfonopoulos, Manolis Ko...
90
Voted
SSDBM
2008
IEEE
131views Database» more  SSDBM 2008»
15 years 3 months ago
Linked Bernoulli Synopses: Sampling along Foreign Keys
Random sampling is a popular technique for providing fast approximate query answers, especially in data warehouse environments. Compared to other types of synopses, random sampling...
Rainer Gemulla, Philipp Rösch, Wolfgang Lehne...
JGAA
2007
135views more  JGAA 2007»
14 years 9 months ago
Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Dat
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
Donatello Conte, Pasquale Foggia, Mario Vento