Sciweavers

2070 search results - page 357 / 414
» Querying Communities in Relational Databases
Sort
View
116
Voted
EDBT
2009
ACM
137views Database» more  EDBT 2009»
14 years 8 months ago
Flexible and scalable storage management for data-intensive stream processing
Data Stream Management Systems (DSMS) operate under strict performance requirements. Key to meeting such requirements is to efficiently handle time-critical tasks such as managing...
Irina Botan, Gustavo Alonso, Peter M. Fischer, Don...
WSDM
2010
ACM
266views Data Mining» more  WSDM 2010»
15 years 8 months ago
Gathering and Ranking Photos of Named Entities with High Precision, High Recall, and Diversity
Knowledge-sharing communities like Wikipedia and automated extraction methods like those of DBpedia enable the construction of large machine-processible knowledge bases with relat...
Bilyana Taneva, Mouna Kacimi, Gerhard Weikum
NGITS
1997
Springer
15 years 3 months ago
Faster Joins, Self Joins and Multi-Way Joins Using Join Indices
We propose a new algorithm, called Stripe-join, for performing a join given a join index. Stripe-join is inspired by an algorithm called \Jive-join" developed by Li and Ross....
Hui Lei, Kenneth A. Ross
ICDE
2009
IEEE
285views Database» more  ICDE 2009»
16 years 20 days ago
Design and Evaluation of the iMed Intelligent Medical Search Engine
-- Searching for medical information on the Web is popular and important. However, medical search has its own unique requirements that are poorly handled by existing medical Web se...
Gang Luo
PODS
2006
ACM
95views Database» more  PODS 2006»
15 years 11 months ago
Randomized computations on large data sets: tight lower bounds
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...
André Hernich, Martin Grohe, Nicole Schweik...