Sciweavers

857 search results - page 114 / 172
» Efficient recursive XML query processing using relational da...
Sort
View
SDM
2010
SIAM
183views Data Mining» more  SDM 2010»
15 years 6 months ago
GraSS: Graph Structure Summarization
Large graph databases are commonly collected and analyzed in numerous domains. For reasons related to either space efficiency or for privacy protection (e.g., in the case of socia...
Kristen LeFevre, Evimaria Terzi
CLUSTER
2009
IEEE
15 years 12 months ago
Analyzing massive astrophysical datasets: Can Pig/Hadoop or a relational DBMS help?
Abstract— As the datasets used to fuel modern scientific discovery grow increasingly large, they become increasingly difficult to manage using conventional software. Parallel d...
Sarah Loebman, Dylan Nunley, YongChul Kwon, Bill H...
144
Voted
IDEAS
2000
IEEE
96views Database» more  IDEAS 2000»
15 years 9 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
PVLDB
2008
122views more  PVLDB 2008»
15 years 4 months ago
Exploiting shared correlations in probabilistic databases
There has been a recent surge in work in probabilistic databases, propelled in large part by the huge increase in noisy data sources -from sensor data, experimental data, data fro...
Prithviraj Sen, Amol Deshpande, Lise Getoor
WWW
2009
ACM
16 years 5 months ago
Online expansion of rare queries for sponsored search
Sponsored search systems are tasked with matching queries to relevant advertisements. The current state-of-the-art matching algorithms expand the user's query using a variety...
Andrei Z. Broder, Peter Ciccolo, Evgeniy Gabrilovi...