@Preamble{
"\ifx \undefined \circled \def \circled #1{(#1)}\fi" #
"\ifx \undefined \k \let \k = \c \fi" #
"\ifx \undefined \ocirc \def \ocirc #1{{\accent'27#1}}\fi" #
"\ifx \undefined \pkg \def \pkg #1{{{\tt #1}}} \fi" #
"\ifx \undefined \reg \def \reg {\circled{R}}\fi"
}
@String{ack-nhfb = "Nelson H. F. Beebe,
University of Utah,
Department of Mathematics, 110 LCB,
155 S 1400 E RM 233,
Salt Lake City, UT 84112-0090, USA,
Tel: +1 801 581 5254,
FAX: +1 801 581 4148,
e-mail: \path|beebe@math.utah.edu|,
\path|beebe@acm.org|,
\path|beebe@computer.org| (Internet),
URL: \path|https://www.math.utah.edu/~beebe/|"}
@String{j-PROC-VLDB-ENDOWMENT = "Proceedings of the VLDB Endowment"}
@Article{Hill:2008:TMO,
author = "Mark D. Hill",
title = "Is transactional memory an oxymoron?",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "1--1",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453858",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Zobel:2008:DSH,
author = "Justin Zobel",
title = "Databases and the silification of health",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "2--2",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453859",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Blott:2008:WWH,
author = "Stephen Blott and Roger Weber",
title = "What's wrong with high-dimensional similarity
search?",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "3--3",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453861",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Bruno:2008:CPD,
author = "Nicolas Bruno and Surajit Chaudhuri",
title = "Constrained physical design tuning",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "4--15",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453863",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Kementsietsidis:2008:SMQ,
author = "Anastasios Kementsietsidis and Frank Neven and Dieter
Van de Craen and Stijn Vansummeren",
title = "Scalable multi-query optimization for exploratory
queries over federated scientific databases",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "16--27",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453864",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{DeWitt:2008:CIC,
author = "David J. DeWitt and Erik Paulson and Eric Robinson and
Jeffrey Naughton and Joshua Royalty and Srinath Shankar
and Andrew Krioukov",
title = "{Clustera}: an integrated computation and data
management system",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "28--41",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453865",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Cheung:2008:PPE,
author = "Alvin Cheung and Samuel Madden",
title = "Performance profiling with {EndoScope}, an
acquisitional software monitoring framework",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "42--53",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453866",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Bar-Yossef:2008:MSE,
author = "Ziv Bar-Yossef and Maxim Gurevich",
title = "Mining search engine query logs via suggestion
sampling",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "54--65",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453868",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Akdere:2008:PBC,
author = "Mert Akdere and U{\u{g}}ur {\c{C}}etintemel and Nesime
Tatbul",
title = "Plan-based complex event detection across distributed
sources",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "66--77",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453869",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Lachmann:2008:FRP,
author = "Alexander Lachmann and Mirek Riedewald",
title = "Finding relevant patterns in bursty sequences",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "78--89",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453870",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Cheng:2008:CLW,
author = "Hao Cheng and Kien A. Hua and Khanh Vu",
title = "Constrained locally weighted clustering",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "90--101",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453871",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Hay:2008:RSR,
author = "Michael Hay and Gerome Miklau and David Jensen and Don
Towsley and Philipp Weis",
title = "Resisting structural re-identification in anonymized
social networks",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "102--114",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453873",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Terrovitis:2008:PPA,
author = "Manolis Terrovitis and Nikos Mamoulis and Panos
Kalnis",
title = "Privacy-preserving anonymization of set-valued data",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "115--125",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453874",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Pang:2008:AQR,
author = "HweeHwa Pang and Kyriakos Mouratidis",
title = "Authenticating the query results of text search
engines",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "126--137",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453875",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Kundu:2008:SST,
author = "Ashish Kundu and Elisa Bertino",
title = "Structural signatures for tree data structures",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "138--150",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453876",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Roitman:2008:MDC,
author = "Haggai Roitman and David Carmel and Elad Yom-Tov",
title = "Maintaining dynamic channel profiles on the {Web}",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "151--162",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453878",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Yang:2008:WDD,
author = "Fan Yang and Nitin Gupta and Chavdar Botev and
Elizabeth F. Churchill and George Levchenko and Jayavel
Shanmugasundaram",
title = "{WYSIWYG} development of data driven {Web}
applications",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "163--175",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453879",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Baykan:2008:WPL,
author = "Eda Baykan and Monika Henzinger and Ingmar Weber",
title = "{Web} page language identification based on {URLs}",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "176--187",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453880",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Han:2008:PQO,
author = "Wook-Shin Han and Wooseong Kwak and Jinsoo Lee and Guy
M. Lohman and Volker Markl",
title = "Parallelizing query optimization",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "188--200",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453882",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Hadjieleftheriou:2008:HSS,
author = "Marios Hadjieleftheriou and Xiaohui Yu and Nick Koudas
and Divesh Srivastava",
title = "Hashed samples: selectivity estimators for set
similarity selection queries",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "201--212",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453883",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Cohen:2008:TEU,
author = "Edith Cohen and Haim Kaplan",
title = "Tighter estimation using bottom $k$ sketches",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "213--229",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453884",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Alexe:2008:STB,
author = "Bogdan Alexe and Wang-Chiew Tan and Yannis
Velegrakis",
title = "{STBenchmark}: towards a benchmark for mapping
systems",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "230--244",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453886",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Katsis:2008:ISR,
author = "Yannis Katsis and Alin Deutsch and Yannis
Papakonstantinou",
title = "Interactive source registration in community-oriented
information integration",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "245--259",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453887",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Hernandez:2008:DED,
author = "Mauricio A. Hern{\'a}ndez and Paolo Papotti and
Wang-Chiew Tan",
title = "Data exchange with data-metadata translations",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "260--273",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453888",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Li:2008:OPN,
author = "Jin Li and Kristin Tufte and Vladislav Shkapenyuk and
Vassilis Papadimos and Theodore Johnson and David
Maier",
title = "Out-of-order processing: a new architecture for
high-performance stream systems",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "274--288",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453890",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Han:2008:SET,
author = "Wook-Shin Han and Haifeng Jiang and Howard Ho and
Quanzhong Li",
title = "{StreamTX}: extracting tuples from streaming {XML}
data",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "289--300",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453891",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Jin:2008:SWT,
author = "Cheqing Jin and Ke Yi and Lei Chen and Jeffrey Xu Yu
and Xuemin Lin",
title = "Sliding-window top-$k$ queries on uncertain streams",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "301--312",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453892",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Koch:2008:CPD,
author = "Christoph Koch and Dan Olteanu",
title = "Conditioning probabilistic databases",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "313--325",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453894",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Beskales:2008:EST,
author = "George Beskales and Mohamed A. Soliman and Ihab F.
Ilyas",
title = "Efficient search for the top-$k$ probable nearest
neighbors in uncertain databases",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "326--339",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453895",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Wang:2008:BML,
author = "Daisy Zhe Wang and Eirinaios Michelakis and Minos
Garofalakis and Joseph M. Hellerstein",
title = "{BayesStore}: managing large, uncertain data
repositories with probabilistic graphical models",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "340--351",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453896",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Deutch:2008:TIT,
author = "Daniel Deutch and Tova Milo",
title = "Type inference and type checking for queries on
execution traces",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "352--363",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453898",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Shang:2008:TVH,
author = "Haichuan Shang and Ying Zhang and Xuemin Lin and
Jeffrey Xu Yu",
title = "Taming verification hardness: an efficient algorithm
for testing subgraph isomorphism",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "364--375",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453899",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Golab:2008:GNO,
author = "Lukasz Golab and Howard Karloff and Flip Korn and
Divesh Srivastava and Bei Yu",
title = "On generating near-optimal tableaux for conditional
functional dependencies",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "376--390",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453900",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Fan:2008:PFD,
author = "Wenfei Fan and Shuai Ma and Yanli Hu and Jie Liu and
Yinghui Wu",
title = "Propagating functional dependencies with conditions",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "391--407",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453901",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Antonellis:2008:SQR,
author = "Ioannis Antonellis and Hector Garcia Molina and Chi
Chao Chang",
title = "{Simrank++}: query rewriting through link analysis of
the click graph",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "408--421",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453903",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Lizorkin:2008:AEO,
author = "Dmitry Lizorkin and Pavel Velikhov and Maxim Grinev
and Denis Turdakov",
title = "Accuracy estimate and optimization techniques for
{SimRank} computation",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "422--433",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453904",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Chandramouli:2008:EES,
author = "Badrish Chandramouli and Jun Yang",
title = "End-to-end support for joins in large-scale
publish\slash subscribe systems",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "434--450",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453905",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Machanavajjhala:2008:SRP,
author = "Ashwin Machanavajjhala and Erik Vee and Minos
Garofalakis and Jayavel Shanmugasundaram",
title = "Scalable ranked publish\slash subscribe",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "451--462",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453906",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Teubner:2008:DCF,
author = "Jens Teubner and Torsten Grust and Sebastian Maneth
and Sherif Sakr",
title = "Dependable cardinality forecasts for {XQuery}",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "463--477",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453908",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Wang:2008:HBS,
author = "Hongzhi Wang and Jianzhong Li and Jizhou Luo and Hong
Gao",
title = "Hash-base subgraph query processing method for
graph-structured {XML} documents",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "478--489",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453909",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Cohen:2008:GXS,
author = "Sara Cohen",
title = "Generating {XML} structure using examples and
constraints",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "490--501",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453910",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Holloway:2008:ROD,
author = "Allison L. Holloway and David J. DeWitt",
title = "Read-optimized databases, in depth",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "502--513",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453912",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Koltsidas:2008:FSL,
author = "Ioannis Koltsidas and Stratis D. Viglas",
title = "Flashing up the storage layer",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "514--525",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453913",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Sears:2008:RCL,
author = "Russell Sears and Mark Callaghan and Eric Brewer",
title = "{Rose}: compressed, log-structured replication",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "526--537",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453914",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Cafarella:2008:WEP,
author = "Michael J. Cafarella and Alon Halevy and Daisy Zhe
Wang and Eugene Wu and Yang Zhang",
title = "{WebTables}: exploring the power of tables on the
{Web}",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "538--549",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453916",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Garrod:2008:SQR,
author = "Charles Garrod and Amit Manjhi and Anastasia Ailamaki
and Bruce Maggs and Todd Mowry and Christopher Olston
and Anthony Tomasic",
title = "Scalable query result caching for {Web} applications",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "550--561",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453917",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Braga:2008:OMD,
author = "Daniele Braga and Stefano Ceri and Florian Daniel and
Davide Martinenghi",
title = "Optimization of multi-domain queries on the {Web}",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "562--573",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453918",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Kwon:2008:FTS,
author = "YongChul Kwon and Magdalena Balazinska and Albert
Greenberg",
title = "Fault-tolerant stream processing using a distributed,
replicated file system",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "574--585",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453920",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Yeh:2008:LLW,
author = "Mi-Yen Yeh and Kun-Lung Wu and Philip S. Yu and
Ming-Syan Chen",
title = "{LeeWave}: level-wise distribution of wavelet
coefficients for processing $k$ {NN} queries over
distributed streams",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "586--597",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453921",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Aguilera:2008:PSD,
author = "Marcos K. Aguilera and Wojciech Golab and Mehul A.
Shah",
title = "A practical scalable distributed {B-tree}",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "598--609",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453922",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Qiao:2008:MMS,
author = "Lin Qiao and Vijayshankar Raman and Frederick Reiss
and Peter J. Haas and Guy M. Lohman",
title = "Main-memory scan sharing for multi-core {CPUs}",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "610--621",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453924",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Johnson:2008:RWP,
author = "Ryan Johnson and Vijayshankar Raman and Richard Sidle
and Garret Swart",
title = "Row-wise parallel predicate evaluation",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "622--634",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453925",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Soundararajan:2008:DPC,
author = "Gokul Soundararajan and Jin Chen and Mohamed A. Sharaf
and Cristiana Amza",
title = "Dynamic partitioning of the cache hierarchy in shared
data centers",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "635--646",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453926",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Neumann:2008:RRS,
author = "Thomas Neumann and Gerhard Weikum",
title = "{RDF-3X}: a {RISC}-style engine for {RDF}",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "647--659",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453927",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Simitsis:2008:MCE,
author = "Alkis Simitsis and Akanksha Baid and Yannis Sismanis
and Berthold Reinwald",
title = "Multidimensional content {eXploration}",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "660--671",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453929",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Fontoura:2008:RTS,
author = "Marcus Fontoura and Vanja Josifovski and Ravi Kumar
and Christopher Olston and Andrew Tomkins and Sergei
Vassilvitskii",
title = "Relaxation in text search using taxonomies",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "672--683",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453930",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Nguyen:2008:LEF,
author = "Hoa Nguyen and Thanh Nguyen and Juliana Freire",
title = "Learning to extract form labels",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "684--694",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453931",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Jayapandian:2008:ACF,
author = "Magesh Jayapandian and H. V. Jagadish",
title = "Automated creation of a forms-based database query
interface",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "695--709",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453932",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Yahia:2008:ENA,
author = "Sihem Amer Yahia and Michael Benedikt and Laks V. S.
Lakshmanan and Julia Stoyanovich",
title = "Efficient network aware search in collaborative
tagging sites",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "710--721",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453934",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Cheng:2008:CUD,
author = "Reynold Cheng and Jinchuan Chen and Xike Xie",
title = "Cleaning uncertain data with quality guarantees",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "722--735",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453935",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Huang:2008:PNA,
author = "Jiansheng Huang and Ting Chen and AnHai Doan and
Jeffrey F. Naughton",
title = "On the provenance of non-answers to queries over
extracted data",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "736--747",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453936",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Zhu:2008:DAP,
author = "Shenghuo Zhu and Tao Li and Zhiyuan Chen and Dingding
Wang and Yihong Gong",
title = "Dynamic active probing of helpdesk databases",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "748--760",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453937",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Curino:2008:GDS,
author = "Carlo A. Curino and Hyun J. Moon and Carlo Zaniolo",
title = "Graceful database schema evolution: the {PRISM}
workbench",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "761--772",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453939",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Chai:2008:ARD,
author = "Xiaoyong Chai and Mayssam Sayyadian and AnHai Doan and
Arnon Rosenthal and Len Seligman",
title = "Analyzing and revising data integration schemas to
improve their matchability",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "773--784",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453940",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Talukdar:2008:LCD,
author = "Partha Pratim Talukdar and Marie Jacob and Muhammad
Salman Mehmood and Koby Crammer and Zachary G. Ives and
Fernando Pereira and Sudipto Guha",
title = "Learning to create data-integrating queries",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "785--796",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453941",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Re:2008:ALP,
author = "Christopher R{\'e} and Dan Suciu",
title = "Approximate lineage for probabilistic databases",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "797--808",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453943",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Sen:2008:ESC,
author = "Prithviraj Sen and Amol Deshpande and Lise Getoor",
title = "Exploiting shared correlations in probabilistic
databases",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "809--820",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453944",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Rastogi:2008:ACU,
author = "Vibhor Rastogi and Dan Suciu and Evan Welbourne",
title = "Access control over uncertain data",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "821--832",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453945",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Cormode:2008:ABG,
author = "Graham Cormode and Divesh Srivastava and Ting Yu and
Qing Zhang",
title = "Anonymizing bipartite graph data using safe
groupings",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "833--844",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453947",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Bu:2008:PPS,
author = "Yingyi Bu and Ada Wai Chee Fu and Raymond Chi Wing
Wong and Lei Chen and Jiuyong Li",
title = "Privacy preserving serial data publishing by role
composition",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "845--856",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453948",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Xiao:2008:OPQ,
author = "Xiaokui Xiao and Yufei Tao",
title = "Output perturbation with query relaxation",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "857--869",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453949",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Lomet:2008:TTI,
author = "David Lomet and Mingsheng Hong and Rimma Nehme and Rui
Zhang",
title = "Transaction time indexing with version compression",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "870--881",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453951",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Moon:2008:MQT,
author = "Hyun J. Moon and Carlo A. Curino and Alin Deutsch and
Chien-Yi Hou and Carlo Zaniolo",
title = "Managing and querying transaction-time databases under
schema evolution",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "882--895",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453952",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Sherkat:2008:EST,
author = "Reza Sherkat and Davood Rafiei",
title = "On efficiently searching trajectories and archival
data for historical similarities",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "896--908",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453953",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Pu:2008:KQC,
author = "Ken Q. Pu and Xiaohui Yu",
title = "Keyword query cleaning",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "909--920",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453955",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Liu:2008:RIR,
author = "Ziyang Liu and Yi Cher",
title = "Reasoning and identifying relevant matches for {XML}
keyword search",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "921--932",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453956",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Xiao:2008:EJE,
author = "Chuan Xiao and Wei Wang and Xuemin Lin",
title = "{Ed-Join}: an efficient algorithm for similarity joins
with edit distance constraints",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "933--944",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453957",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Agrawal:2008:SAH,
author = "Sanjay Agrawal and Kaushik Chakrabarti and Surajit
Chaudhuri and Venkatesh Ganti",
title = "Scalable ad-hoc entity extraction from text
collections",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "945--957",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453958",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Agrawal:2008:SSS,
author = "Parag Agrawal and Daniel Kifer and Christopher
Olston",
title = "Scheduling shared scans of large data files",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "958--969",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453960",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Nath:2008:OMV,
author = "Suman Nath and Phillip B. Gibbons",
title = "Online maintenance of very large random samples on
flash storage",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "970--983",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453961",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Ge:2008:SLA,
author = "Tingjian Ge and Stan Zdonik",
title = "A skip-list approach for efficiently processing
forecasting queries",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "984--995",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453962",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Phan:2008:RRF,
author = "Thomas Phan and Wen-Syan Li",
title = "A request-routing framework for {SOA}-based enterprise
computing",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "996--1007",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453963",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Weiss:2008:HSI,
author = "Cathrin Weiss and Panagiotis Karras and Abraham
Bernstein",
title = "{Hexastore}: sextuple indexing for {Semantic Web} data
management",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "1008--1019",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453965",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Shahabi:2008:ILS,
author = "Cyrus Shahabi and Lu-An Tang and Songhua Xing",
title = "Indexing land surface for efficient {kNN} query",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "1020--1031",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453966",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Wong:2008:ESQ,
author = "Raymond Chi-Wing Wong and Ada Wai-Chee Fu and Jian Pei
and Yip Sing Ho and Tai Wong and Yubao Liu",
title = "Efficient skyline querying with variable user
preferences on nominal attributes",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "1032--1043",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453967",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Guo:2008:ETP,
author = "Lin Guo and Sihem Amer Yahia and Raghu Ramakrishnan
and Jayavel Shanmugasundaram and Utkarsh Srivastava and
Erik Vee",
title = "Efficient top-$k$ processing over query-dependent
functions",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "1044--1055",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453968",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Wu:2008:FER,
author = "Wei Wu and Fei Yang and Chee-Yong Chan and Kian-Lee
Tan",
title = "{FINCH}: evaluating reverse $k$-Nearest-Neighbor
queries on location data",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "1056--1067",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453970",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Jeung:2008:DCT,
author = "Hoyoung Jeung and Man Lung Yiu and Xiaofang Zhou and
Christian S. Jensen and Heng Tao Shen",
title = "Discovery of convoys in trajectory databases",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "1068--1080",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453971",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Lee:2008:TTC,
author = "Jae-Gil Lee and Jiawei Han and Xiaolei Li and Hector
Gonzalez",
title = "{TraClass}: trajectory classification using
hierarchical region-based and trajectory-based
clustering",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "1081--1094",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453972",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Nutanong:2008:VDQ,
author = "Sarana Nutanong and Rui Zhang and Egemen Tanin and
Lars Kulik",
title = "The {V*-Diagram}: a query-dependent approach to moving
{KNN} queries",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "1095--1106",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453973",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Guravannavar:2008:RPB,
author = "Ravindra Guravannavar and S. Sudarshan",
title = "Rewriting procedures for batched bindings",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "1107--1123",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453975",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{D:2008:IRP,
author = "Harish D. and Pooja N. Darera and Jayant R. Haritsa",
title = "Identifying robust plans through plan diagram
reduction",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "1124--1140",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453976",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Chaudhuri:2008:PYG,
author = "Surajit Chaudhuri and Vivek Narasayya and Ravi
Ramamurthy",
title = "A pay-as-you-go framework for query execution
feedback",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "1141--1152",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453977",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Condie:2008:ERM,
author = "Tyson Condie and David Chu and Joseph M. Hellerstein
and Petros Maniatis",
title = "Evita raced: metacompilation for declarative
networks",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "1153--1165",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453978",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Chiang:2008:DDQ,
author = "Fei Chiang and Ren{\'e}e J. Miller",
title = "Discovering data quality rules",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "1166--1177",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453980",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Zhang:2008:MNR,
author = "Xiang Zhang and Feng Pan and Wei Wang and Andrew
Nobel",
title = "Mining non-redundant high order correlations in binary
data",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "1178--1188",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453981",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Dalvi:2008:KSE,
author = "Bhavana Bharat Dalvi and Meghana Kshirsagar and S.
Sudarshan",
title = "Keyword search on external memory data graphs",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "1189--1204",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453982",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Koltsidas:2008:SHD,
author = "Ioannis Koltsidas and Heiko M{\"u}ller and Stratis D.
Viglas",
title = "Sorting hierarchical data in external memory for
archiving",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "1205--1216",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453983",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Metwally:2008:SSP,
author = "Ahmed Metwally and Fatih Emek{\c{c}}i and Divyakant
Agrawal and Amr {El Abbadi}",
title = "{SLEUTH}: {Single-pubLisher attack dEtection Using
correlaTion Hunting}",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1217--1228",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454161",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Poess:2008:ECK,
author = "Meikel Poess and Raghunath Othayoth Nambiar",
title = "Energy cost, the key challenge of today's data
centers: a power consumption analysis of {TPC}-{C}
results",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1229--1240",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454162",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Madhavan:2008:GDW,
author = "Jayant Madhavan and David Ko and Lucja Kot and Vignesh
Ganapathy and Alex Rasmussen and Alon Halevy",
title = "{Google}'s {Deep Web} crawl",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1241--1252",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454163",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Weis:2008:ISD,
author = "Melanie Weis and Felix Naumann and Ulrich Jehle and
Jens Lufter and Holger Schuster",
title = "Industry-scale duplicate detection",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1253--1264",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454165",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Chaiken:2008:SEE,
author = "Ronnie Chaiken and Bob Jenkins and Per-{\AA}ke Larson
and Bill Ramsey and Darren Shakib and Simon Weaver and
Jingren Zhou",
title = "{SCOPE}: easy and efficient parallel processing of
massive data sets",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1265--1276",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454166",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Cooper:2008:PYH,
author = "Brian F. Cooper and Raghu Ramakrishnan and Utkarsh
Srivastava and Adam Silberstein and Philip Bohannon and
Hans-Arno Jacobsen and Nick Puz and Daniel Weaver and
Ramana Yerneni",
title = "{PNUTS}: {Yahoo!}'s hosted data serving platform",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1277--1288",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454167",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Acharya:2008:RSF,
author = "Srini Acharya and Peter Carlin and Cesar
Galindo-Legaria and Krzysztof Kozielczyk and Pawel
Terlecki and Peter Zabback",
title = "Relational support for flexible schema scenarios",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1289--1300",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454169",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Mukherjee:2008:OSS,
author = "Niloy Mukherjee and Bharath Aleti and Amit Ganesh and
Krishna Kunchithapadam and Scott Lynn and Sujatha
Muthulingam and Kam Shergill and Shaoyu Wang and Wei
Zhang",
title = "{Oracle SecureFiles System}",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1301--1312",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454170",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Chhugani:2008:EIS,
author = "Jatin Chhugani and Anthony D. Nguyen and Victor W. Lee
and William Macy and Mostafa Hagog and Yen-Kuang Chen
and Akram Baransi and Sanjeev Kumar and Pradeep Dubey",
title = "Efficient implementation of sorting on multi-core
{SIMD CPU} architecture",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1313--1324",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454171",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Dey:2008:EAQ,
author = "Atreyee Dey and Sourjya Bhaumik and Harish D. and
Jayant R. Haritsa",
title = "Efficiently approximating query optimizer plan
diagrams",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1325--1336",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454173",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Slezak:2008:BAD,
author = "Dominik {\'S}l{\k{e}}zak and Jakub Wr{\'o}blewski and
Victoria Eastwood and Piotr Synak",
title = "{Brighthouse}: an analytic data warehouse for ad-hoc
queries",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1337--1345",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454174",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Ziauddin:2008:OPC,
author = "Mohamed Ziauddin and Dinesh Das and Hong Su and Yali
Zhu and Khaled Yagoub",
title = "Optimizer plan change management: improved stability
and performance in {Oracle} 11g",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1346--1355",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454175",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Liu:2008:TPX,
author = "Zhen Hua Liu and Sivasankaran Chandrasekar and Thomas
Baby and Hui J. Chang",
title = "Towards a physical {XML} independent {XQuery\slash
SQL\slash XML} engine",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1356--1367",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454177",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Lee:2008:CQP,
author = "Allison W. Lee and Mohamed Zait",
title = "Closing the query processing loop in {Oracle 11g}",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1368--1378",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454178",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Jain:2008:TSS,
author = "Namit Jain and Shailendra Mishra and Anand Srinivasan
and Johannes Gehrke and Jennifer Widom and Hari
Balakrishnan and U{\u{g}}ur {\c{C}}etintemel and Mitch
Cherniack and Richard Tibbetts and Stan Zdonik",
title = "Towards a streaming {SQL} standard",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1379--1390",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454179",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Huang:2008:ESG,
author = "Yu Huang and Ziyang Liu and Yi Chen",
title = "{eXtract}: a snippet generation system for {XML}
search",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1392--1395",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454181",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Terwilliger:2008:LIQ,
author = "James F. Terwilliger and Sergey Melnik and Philip A.
Bernstein",
title = "Language-integrated querying of {XML} data in {SQL}
server",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1396--1399",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454182",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Mathis:2008:XXC,
author = "Christian Mathis and Andreas M. Weiner and Theo
H{\"a}rder and Caesar Ralf Franz Hoppen",
title = "{XTCcmp}: {XQuery} compilation on {XTC}",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1400--1403",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454183",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Tian:2008:PGG,
author = "Yuanyuan Tian and Jignesh M. Patel and Viji Nair and
Sebastian Martini and Matthias Kretzler",
title = "{Periscope\slash GQ}: a graph querying toolkit",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1404--1407",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454184",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Balmin:2008:SSS,
author = "Andrey Balmin and Latha Colby and Emiran Curtmola and
Quanzhong Li and Fatma {\"O}zcan and Sharath Srinivas
and Zografoula Vagena",
title = "{SEDA}: a system for search, exploration, discovery,
and analysis of {XML Data}",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1408--1411",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454185",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Motahari:2008:PSD,
author = "Hamid Motahari and Boualem Benatallah and Regis
Saint-Paul and Fabio Casati and Periklis Andritsos",
title = "Process spaceship: discovering and exploring process
views from event logs in data spaces",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1412--1415",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454186",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Lupu:2008:PPP,
author = "Mihai Lupu and Y. C. Tay",
title = "{P} 3 {N}: profiling the potential of a peer-based
data management system",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1416--1419",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454188",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Tlili:2008:PLT,
author = "Mounir Tlili and W. Kokou Dedzoe and Esther Pacitti
and Patrick Valduriez and Reza Akbarinia and Pascal
Molli and G{\'e}r{\^o}me Canals and St{\'e}phane
Lauri{\`e}re",
title = "{P2P} logging and timestamping for reconciliation",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1420--1423",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454189",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Luu:2008:ASP,
author = "Toan Luu and Gleb Skobeltsyn and Fabius Klemm and
Maroje Puh and Ivana Podnar Zarko and Martin Rajman and
Karl Aberer",
title = "{AlvisP2P}: scalable peer-to-peer text retrieval in a
structured {P2P} network",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1424--1427",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454190",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Abiteboul:2008:WEP,
author = "S. Abiteboul and T. Allard and P. Chatalic and G.
Gardarin and A. Ghitescu and F. Goasdou{\'e} and I.
Manolescu and B. Nguyen and M. Ouazara and A. Somani
and N. Travers and G. Vasile and S. Zoupanos",
title = "{WebContent}: efficient {P2P Warehousing} of {Web}
data",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1428--1431",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454191",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Jurczyk:2008:DED,
author = "Pawel Jurczyk and Li Xiong",
title = "{DObjects}: enabling distributed data services for
metacomputing platforms",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1432--1435",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454192",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Shao:2008:ETR,
author = "Qihong Shao and Yi Chen and Shu Tao and Xifeng Yan and
Nikos Anerousis",
title = "{EasyTicket}: a ticket routing recommendation engine
for enterprise problem resolution",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1436--1439",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454193",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Duda:2008:ACI,
author = "Cristian Duda and Gianni Frey and Donald Kossmann and
Chong Zhou",
title = "{AJAXSearch}: crawling, indexing and searching {Web
2.0} applications",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1440--1443",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454195",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Liu:2008:MSH,
author = "Kun Liu and Evimaria Terzi and Tyrone Grandison",
title = "{ManyAspects}: a system for highlighting diverse
concepts in documents",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1444--1447",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454196",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Curtmola:2008:XDC,
author = "Emiran Curtmola and Alin Deutsch and Dionysios
Logothetis and K. K. Ramakrishnan and Divesh Srivastava
and Kenneth Yocum",
title = "{XTreeNet}: democratic community search",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1448--1451",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454197",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Li:2008:EVK,
author = "Guoliang Li and Jianhua Feng and Jianyong Wang and
Lizhu Zhou",
title = "An effective and versatile keyword search engine on
heterogeneous data sources",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1452--1455",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454198",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Baid:2008:DME,
author = "Akanksha Baid and Andrey Balmin and Heasoo Hwang and
Erik Nijkamp and Jun Rao and Berthold Reinwald and
Alkis Simitsis and Yannis Sismanis and Frank van Ham",
title = "{DBPubs}: multidimensional exploration of database
publications",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1456--1459",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454199",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Fan:2008:SDQ,
author = "Wenfei Fan and Floris Geerts and Xibei Jia",
title = "{Semandaq}: a data quality system based on conditional
functional dependencies",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1460--1463",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454200",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Katsis:2008:RTI,
author = "Yannis Katsis and Alin Deutsch and Yannis
Papakonstantinou and Keliang Zhao",
title = "{RIDE}: a tool for interactive source registration in
community-oriented information integration",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1464--1467",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454202",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Alexe:2008:CEM,
author = "Bogdan Alexe and Wang-Chiew Tan and Yannis
Velegrakis",
title = "Comparing and evaluating mapping systems with
{STBenchmark}",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1468--1471",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454203",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Logothetis:2008:AHD,
author = "Dionysios Logothetis and Kenneth Yocum",
title = "Ad-hoc data processing in the cloud",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1472--1475",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454204",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Weigel:2008:LSC,
author = "Felix Weigel and Biswanath Panda and Mirek Riedewald
and Johannes Gehrke and Manuel Calimlim",
title = "Large-scale collaborative analysis and extraction of
{Web} data",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1476--1479",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454205",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Crecelius:2008:MSS,
author = "Tom Crecelius and Mouna Kacimi and Sebastian Michel
and Thomas Neumann and Josiane Xavier Parreira and Ralf
Schenkel and Gerhard Weikum",
title = "Making {SENSE}: socially enhanced search and
exploration",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1480--1483",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454206",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Lu:2008:ASD,
author = "Wentian Lu and Gerome Miklau",
title = "{AuditGuard}: a system for database auditing under
retention restrictions",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1484--1487",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454207",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Hu:2008:QVQ,
author = "Ling Hu and Kenneth A. Ross and Yuan-Chi Chang and
Christian A. Lang and Donghui Zhang",
title = "{QueryScope}: visualizing queries for repeatable
database tuning",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1488--1491",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454209",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Hose:2008:WIT,
author = "Katja Hose and Daniel Klan and Matthias Marx and
Kai-Uwe Sattler",
title = "When is it time to rethink the aggregate configuration
of your {OLAP} server?",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1492--1495",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454210",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Kallman:2008:HSH,
author = "Robert Kallman and Hideaki Kimura and Jonathan Natkins
and Andrew Pavlo and Alexander Rasin and Stanley Zdonik
and Evan P. C. Jones and Samuel Madden and Michael
Stonebraker and Yang Zhang and John Hugg and Daniel J.
Abadi",
title = "{H-store}: a high-performance, distributed main memory
transaction processing system",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1496--1499",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454211",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Perlman:2008:OIN,
author = "Eric Perlman and Randal Burns and Michael Kazhdan",
title = "Organizing and indexing non-convex regions",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1500--1503",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454212",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Paquet:2008:CME,
author = "Eric Paquet and Herna L. Viktor",
title = "{Capri\slash MR}: exploring protein databases from a
structural and physicochemical point of view",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1504--1507",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454213",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Guo:2008:CMM,
author = "Fan Guo and Lei Li and Christos Faloutsos and Eric P.
Xing",
title = "{C-DEM}: a multi-modal query system for {Drosophila
Embryo} databases",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1508--1511",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454214",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Milo:2008:QMD,
author = "Tova Milo and Daniel Deutch",
title = "Querying and monitoring distributed business
processes",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1512--1515",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454216",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Franklin:2008:FTD,
author = "Michael Franklin and Alon Halevy and David Maier",
title = "A first tutorial on dataspaces",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1516--1517",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454217",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Franconi:2008:ODM,
author = "Enrico Franconi",
title = "Ontologies and databases: myths and challenges",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1518--1519",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454218",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Balazinska:2008:SAP,
author = "Magdalena Balazinska and Christopher R{\'e} and Dan
Suciu",
title = "Systems aspects of probabilistic data management",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1520--1521",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454219",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Fan:2008:RIC,
author = "Wenfei Fan and Floris Geerts and Xibei Jia",
title = "A revival of integrity constraints for data cleaning",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1522--1523",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454220",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Moro:2008:XSS,
author = "Mirella M. Moro and Zografoula Vagena and Vassilis J.
Tsotras",
title = "{XML Structural Summaries}",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1524--1525",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454221",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Sharaf:2008:SCQ,
author = "Mohamed A. Sharaf and Alexandros Labrinidis and Panos
K. Chrysanthis",
title = "Scheduling continuous queries in data stream
management systems",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1526--1527",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454222",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Kriegel:2008:DCM,
author = "Hans-Peter Kriegel and Peer Kr{\"o}ger and Arthur
Zimek",
title = "Detecting clusters in moderate-to-high dimensional
data: subspace clustering, pattern-based clustering,
and correlation clustering",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1528--1529",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454223",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Cormode:2008:FFI,
author = "Graham Cormode and Marios Hadjieleftheriou",
title = "Finding frequent items in data streams",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1530--1541",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454225",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Ding:2008:QMT,
author = "Hui Ding and Goce Trajcevski and Peter Scheuermann and
Xiaoyue Wang and Eamonn Keogh",
title = "Querying and mining of time series data: experimental
comparison of representations and distance measures",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1542--1552",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454226",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Sidirourgos:2008:CSS,
author = "Lefteris Sidirourgos and Romulo Goncalves and Martin
Kersten and Niels Nes and Stefan Manegold",
title = "Column-store support for {RDF} data management: not
all swans are white",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1553--1563",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454227",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Sans:2008:PBN,
author = "Virginie Sans and Dominique Laurent",
title = "Prefix based numbering schemes for {XML}: techniques,
applications and performances",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1564--1573",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454228",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Chen:2008:BEM,
author = "Su Chen and Christian S. Jensen and Dan Lin",
title = "A benchmark for evaluating moving object indexes",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1574--1585",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454229",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Dittrich:2008:DRM,
author = "Jens Dittrich and Lukas Blunschi and Marcos Antonio
Vaz Salles",
title = "Dwarfs in the rearview mirror: how big are they
really?",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1586--1597",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454230",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Shao:2008:CTE,
author = "Jie Shao and Heng Tao Shen and Xiaofang Zhou",
title = "Challenges and techniques for effective and efficient
similarity search in large video databases",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1598--1603",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454232",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Hopfgartner:2008:SIM,
author = "Frank Hopfgartner",
title = "Studying interaction methodologies in video
retrieval",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1604--1608",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454233",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Lo:2008:MPR,
author = "David Lo and Siau-Cheng Khoo",
title = "Mining patterns and rules for software specification
discovery",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1609--1616",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454234",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Biveinis:2008:TEM,
author = "Laurynas Biveinis and Simonas Saltenis",
title = "Towards efficient main-memory use for optimum tree
index update",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1617--1622",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454236",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Holupirek:2008:IFT,
author = "Alexander Holupirek and Marc H. Scholl",
title = "Implementing filesystems by tree-aware {DBMSs}",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1623--1630",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454237",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Avanes:2008:AWS,
author = "Artin Avanes and Johann-Christoph Freytag",
title = "Adaptive workflow scheduling under resource allocation
constraints and network dynamics",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1631--1637",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454238",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Zerr:2008:PPD,
author = "Sergej Zerr and Wolfgang Nejdl",
title = "Privacy preserving document indexing infrastructure
for a distributed environment",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1638--1643",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454240",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Miao:2008:GTG,
author = "Jiajia Miao",
title = "{GS-TMS}: a global stream-based threat monitor
system",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1644--1651",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454241",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Kharlamov:2008:III,
author = "Evgeny Kharlamov and Werner Nutt",
title = "Incompleteness in information integration",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1652--1658",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454242",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Deutch:2008:QWB,
author = "Daniel Deutch and Tova Milo",
title = "Querying {Web}-based applications under models of
uncertainty",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1659--1665",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454244",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Silvasti:2008:XDF,
author = "Panu Silvasti and Seppo Sippu and Eljas
Soisalon-Soininen",
title = "{XML}-document-filtering automaton",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1666--1671",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454245",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Scholl:2008:CDD,
author = "Tobias Scholl and Alfons Kemper",
title = "Community-driven data grids",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "2",
pages = "1672--1677",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1454159.1454246",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:44 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Gatterbauer:2009:BIA,
author = "Wolfgang Gatterbauer and Magdalena Balazinska and
Nodira Khoussainova and Dan Suciu",
title = "Believe it or not: adding belief annotations to
databases",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "1--12",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Zhang:2009:SSB,
author = "Zhenjie Zhang and Beng Chin Ooi and Srinivasan
Parthasarathy and Anthony K. H. Tung",
title = "Similarity search on {Bregman} divergence: towards
non-metric indexing",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "13--24",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Zeng:2009:CSA,
author = "Zhiping Zeng and Anthony K. H. Tung and Jianyong Wang
and Jianhua Feng and Lizhu Zhou",
title = "Comparing stars: on approximating graph edit
distance",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "25--36",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Whang:2009:IBE,
author = "Steven Euijong Whang and Hector Garcia-Molina and Chad
Brower and Jayavel Shanmugasundaram and Sergei
Vassilvitskii and Erik Vee and Ramana Yerneni",
title = "Indexing {Boolean} expressions",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "37--48",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Zhou:2009:SDS,
author = "Yongluan Zhou and Ali Salehi and Karl Aberer",
title = "Scalable delivery of stream query result",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "49--60",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Benedikt:2009:SBI,
author = "Michael Benedikt and James Cheney",
title = "Schema-based independence analysis for {XML} updates",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "61--72",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Nehme:2009:TSD,
author = "Rimma V. Nehme and Elke A. Rundensteiner and Elisa
Bertino",
title = "Tagging stream data for rich real-time services",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "73--84",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Sarma:2009:RMP,
author = "Atish Das Sarma and Ashwin Lall and Danupon Nanongkai
and Jun Xu",
title = "Randomized multi-pass streaming skyline algorithms",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "85--96",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Reeves:2009:MMT,
author = "Galen Reeves and Jie Liu and Suman Nath and Feng
Zhao",
title = "Managing massive time series streams with multi-scale
compressed trickles",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "97--108",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Wu:2009:PAM,
author = "Tianyi Wu and Dong Xin and Qiaozhu Mei and Jiawei
Han",
title = "Promotion analysis in multi-dimensional space",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "109--120",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Sarkas:2009:MDK,
author = "Nikos Sarkas and Nilesh Bansal and Gautam Das and Nick
Koudas",
title = "Measure-driven keyword-query expansion",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "121--132",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Liu:2009:UTD,
author = "Bin Liu and H. V. Jagadish",
title = "Using trees to depict a forest",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "133--144",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Elmeleegy:2009:OPW,
author = "Hazem Elmeleegy and Ahmed K. Elmagarmid and Emmanuel
Cecchet and Walid G. Aref and Willy Zwaenepoel",
title = "Online piece-wise linear approximation of numerical
streams with precision guarantees",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "145--156",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Stern:2009:WTE,
author = "Mirco Stern and Erik Buchmann and Klemens B{\"o}hm",
title = "A wavelet transform for efficient consolidation of
sensor relations with quality guarantees",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "157--168",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Yu:2009:EAQ,
author = "Liu Yu and Jianzhong Li and Hong Gao and Xiaolin
Fang",
title = "Enabling $ \epsilon $-approximate querying in sensor
networks",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "169--180",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Nandi:2009:HUS,
author = "Arnab Nandi and Philip A. Bernstein",
title = "{HAMSTER}: using search clicklogs for schema and
taxonomy matching",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "181--192",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Kot:2009:CUE,
author = "Lucja Kot and Christoph Koch",
title = "Cooperative update exchange in the {Youtopia} system",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "193--204",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Papapetrou:2009:RBA,
author = "Panagiotis Papapetrou and Vassilis Athitsos and George
Kollios and Dimitrios Gunopulos",
title = "Reference-based alignment in large sequence
databases",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "205--216",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Das:2009:TCM,
author = "Sudipto Das and Shyam Antony and Divyakant Agrawal and
Amr {El Abbadi}",
title = "Thread cooperation in multicore architectures for
frequency counting over multiple data streams",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "217--228",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Mueller:2009:SWQ,
author = "Rene Mueller and Jens Teubner and Gustavo Alonso",
title = "Streams on wires: a query compiler for {FPGAs}",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "229--240",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Chandramouli:2009:FPD,
author = "Badrish Chandramouli and Jonathan Goldstein and David
Maier",
title = "On-the-fly progress detection in iterative stream
queries",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "241--252",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Kraska:2009:CRC,
author = "Tim Kraska and Martin Hentschel and Gustavo Alonso and
Donald Kossmann",
title = "Consistency rationing in the cloud: pay only when it
matters",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "253--264",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Lomet:2009:LKR,
author = "David Lomet and Mohamed F. Mokbel",
title = "Locking key ranges with unbundled transaction
services",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "265--276",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Candea:2009:SPJ,
author = "George Candea and Neoklis Polyzotis and Radek
Vingralek",
title = "A scalable, predictable join operator for highly
concurrent data warehouses",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "277--288",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Gupta:2009:ATA,
author = "Rahul Gupta and Sunita Sarawagi",
title = "Answering table augmentation queries from unstructured
lists on the {Web}",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "289--300",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Cautis:2009:ERX,
author = "Bogdan Cautis and Alin Deutsch and Nicola Onose and
Vasilis Vassalos",
title = "Efficient rewriting of {XPath} queries using {Query
Set Specifications}",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "301--312",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Liu:2009:SSR,
author = "Ziyang Liu and Peng Sun and Yi Chen",
title = "Structured search result differentiation",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "313--324",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Dragut:2009:HAM,
author = "Eduard C. Dragut and Thomas Kabisch and Clement Yu and
Ulf Leser",
title = "A hierarchical approach to model {Web} query
interfaces for {Web} source integration",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "325--336",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Cong:2009:ERT,
author = "Gao Cong and Christian S. Jensen and Dingming Wu",
title = "Efficient retrieval of the top-$k$ most relevant
spatial {Web} objects",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "337--348",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Dragut:2009:SWR,
author = "Eduard Dragut and Fang Fang and Prasad Sistla and
Clement Yu and Weiyi Meng",
title = "Stop word and related problems in {Web} interface
integration",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "349--360",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Agrawal:2009:LAT,
author = "Devesh Agrawal and Deepak Ganesan and Ramesh Sitaraman
and Yanlei Diao and Shashi Singh",
title = "Lazy-Adaptive {Tree}: an optimized index structure for
flash devices",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "361--372",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Lee:2009:MDM,
author = "Rubao Lee and Xiaoning Ding and Feng Chen and Qingda
Lu and Xiaodong Zhang",
title = "{MCC-DB}: minimizing cache conflicts in multi-core
processors for databases",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "373--384",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Willhalm:2009:SSU,
author = "Thomas Willhalm and Nicolae Popovici and Yazan Boshmaf
and Hasso Plattner and Alexander Zeier and Jan
Schaffner",
title = "{SIMD-scan}: ultra fast in-memory table scan using
on-chip vector processing units",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "385--394",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Chaudhuri:2009:MDC,
author = "Surajit Chaudhuri and Venkatesh Ganti and Dong Xin",
title = "Mining document collections to facilitate accurate
approximate entity matching",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "395--406",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Fan:2009:RAR,
author = "Wenfei Fan and Xibei Jia and Jianzhong Li and Shuai
Ma",
title = "Reasoning about record matching rules",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "407--418",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Dobra:2009:TCE,
author = "Alin Dobra and Chris Jermaine and Florin Rusu and Fei
Xu",
title = "Turbo-charging estimate convergence in {DBO}",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "419--430",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Cohen:2009:CSA,
author = "Edith Cohen and Nick Duffield and Haim Kaplan and
Carsten Lund and Mikkel Thorup",
title = "Composable, scalable, and accurate weight
summarization of unaggregated data sets",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "431--442",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Wu:2009:DOA,
author = "Sai Wu and Shouxu Jiang and Beng Chin Ooi and Kian-Lee
Tan",
title = "Distributed online aggregations",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "443--454",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Koloniari:2009:RBC,
author = "Georgia Koloniari and Evaggelia Pitoura",
title = "A recall-based cluster formation game in peer-to-peer
systems",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "455--466",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Fekete:2009:QIA,
author = "Alan Fekete and Shirley N. Goldrei and Jorge P{\'e}rez
Asenjo",
title = "Quantifying isolation anomalies",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "467--478",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Johnson:2009:IOS,
author = "Ryan Johnson and Ippokratis Pandis and Anastasia
Ailamaki",
title = "Improving {OLTP} scalability using speculative lock
inheritance",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "479--489",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Sears:2009:SBR,
author = "Russell Sears and Eric Brewer",
title = "Segment-based recovery: write-ahead logging
revisited",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "490--501",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Li:2009:UAR,
author = "Jian Li and Barna Saha and Amol Deshpande",
title = "A unified approach to ranking in probabilistic
databases",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "502--513",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Arasu:2009:LST,
author = "Arvind Arasu and Surajit Chaudhuri and Raghav
Kaushik",
title = "Learning string transformations from examples",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "514--525",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Cormode:2009:PHP,
author = "Graham Cormode and Antonios Deligiannakis and Minos
Garofalakis and Andrew McGregor",
title = "Probabilistic histograms for probabilistic data",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "526--537",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Greenshpan:2009:AM,
author = "Ohad Greenshpan and Tova Milo and Neoklis Polyzotis",
title = "Autocompletion for mashups",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "538--549",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Dong:2009:ICD,
author = "Xin Luna Dong and Laure Berti-Equille and Divesh
Srivastava",
title = "Integrating conflicting data: the role of source
dependence",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "550--561",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Dong:2009:TDC,
author = "Xin Luna Dong and Laure Berti-Equille and Divesh
Srivastava",
title = "Truth discovery and copying detection in a dynamic
world",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "562--573",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Golab:2009:SD,
author = "Lukasz Golab and Howard Karloff and Flip Korn and
Avishek Saha and Divesh Srivastava",
title = "Sequential dependencies",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "574--585",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Denev:2009:SFQ,
author = "Dimitar Denev and Arturas Mazeika and Marc Spaniol and
Gerhard Weikum",
title = "{SHARC}: framework for quality-conscious {Web}
archiving",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "586--597",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Beskales:2009:MQP,
author = "George Beskales and Mohamed A. Soliman and Ihab F.
Ilyas and Shai Ben-David",
title = "Modeling and querying possible repairs in duplicate
detection",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "598--609",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Mindolin:2009:DRI,
author = "Denis Mindolin and Jan Chomicki",
title = "Discovering relative importance of skyline
attributes",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "610--621",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Kim:2009:PDB,
author = "Min-Soo Kim and Jiawei Han",
title = "A particle-and-density based evolutionary clustering
method for dynamic networks",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "622--633",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Yang:2009:SRD,
author = "Xiaoyan Yang and Cecilia M. Procopiuc and Divesh
Srivastava",
title = "Summarizing relational databases",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "634--645",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Cohen:2009:CWS,
author = "Edith Cohen and Haim Kaplan and Subhabrata Sen",
title = "Coordinated weighted sampling for estimating
aggregates over multiple weight assignments",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "646--657",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Lee:2009:PLB,
author = "Hongrae Lee and Raymond T. Ng and Kyuseok Shim",
title = "Power-law based estimation of set similarity join
size",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "658--669",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Karras:2009:OSL,
author = "Panagiotis Karras",
title = "Optimality and scalability in lattice histogram
construction",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "670--681",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Vigfusson:2009:APD,
author = "Ymir Vigfusson and Adam Silberstein and Brian F.
Cooper and Rodrigo Fonseca",
title = "Adaptively parallelizing distributed range queries",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "682--693",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Tatikonda:2009:MTS,
author = "Shirish Tatikonda and Srinivasan Parthasarathy",
title = "Mining tree-structured data on multicore systems",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "694--705",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Unterbrunner:2009:PPU,
author = "P. Unterbrunner and G. Giannikis and G. Alonso and D.
Fauser and D. Kossmann",
title = "Predictable performance for unpredictable workloads",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "706--717",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Zhou:2009:GCB,
author = "Yang Zhou and Hong Cheng and Jeffrey Xu Yu",
title = "Graph clustering based on structural\slash attribute
similarities",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "718--729",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{AlHasan:2009:OSS,
author = "Mohammad {Al Hasan} and Mohammed J. Zaki",
title = "Output space sampling for graph patterns",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "730--741",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Chen:2009:MGP,
author = "Chen Chen and Cindy X. Lin and Matt Fredrikson and
Mihai Christodorescu and Xifeng Yan and Jiawei Han",
title = "Mining graph patterns efficiently via randomized
summaries",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "742--753",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Amer-Yahia:2009:GRS,
author = "Sihem Amer-Yahia and Senjuti Basu Roy and Ashish
Chawlat and Gautam Das and Cong Yu",
title = "Group recommendation: semantics and efficiency",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "754--765",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Bhagat:2009:CBG,
author = "Smriti Bhagat and Graham Cormode and Balachander
Krishnamurthy and Divesh Srivastava",
title = "Class-based graph anonymization for social network
data",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "766--777",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Sarkas:2009:ISS,
author = "Nikos Sarkas and Gautam Das and Nick Koudas",
title = "Improved search for socially annotated data",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "778--789",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Machanavajjhala:2009:DPA,
author = "Ashwin Machanavajjhala and Johannes Gehrke and
Michaela G{\"o}tz",
title = "Data publishing against realistic adversaries",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "790--801",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Pang:2009:SVO,
author = "HweeHwa Pang and Jilian Zhang and Kyriakos
Mouratidis",
title = "Scalable verification for outsourced dynamic
databases",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "802--813",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Xiao:2009:ORP,
author = "Xiaokui Xiao and Yufei Tao and Minghua Chen",
title = "Optimal random perturbation at multiple privacy
levels",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "814--825",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Assent:2009:ADE,
author = "Ira Assent and Marc Wichterich and Ralph Krieger and
Hardy Kremer and Thomas Seidl",
title = "Anticipatory {DTW} for efficient similarity search in
time series databases",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "826--837",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Tsirogiannis:2009:IPL,
author = "Dimitris Tsirogiannis and Sudipto Guha and Nick
Koudas",
title = "Improving the performance of list intersection",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "838--849",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Kaushik:2009:CHP,
author = "Raghav Kaushik and Dan Suciu",
title = "Consistent histograms in the presence of distinct
value counts",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "850--861",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Aggarwal:2009:GCI,
author = "Charu Aggarwal and Yan Xie and Philip S. Yu",
title = "{GConnect}: a connectivity index for massive
disk-resident graphs",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "862--873",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Yang:2009:SES,
author = "Di Yang and Elke A. Rundensteiner and Matthew O.
Ward",
title = "A shared execution strategy for multiple pattern
mining requests over streaming data",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "874--885",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Zou:2009:DJP,
author = "Lei Zou and Lei Chen and M. Tamer {\"O}zsu",
title = "Distance-join: pattern match query in a large graph
database",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "886--897",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Wan:2009:CCP,
author = "Qian Wan and Raymond Chi-Wing Wong and Ihab F. Ilyas
and M. Tamer {\"O}zsu and Yu Peng",
title = "Creating competitive products",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "898--909",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Mueller:2009:DPF,
author = "Rene Mueller and Jens Teubner and Gustavo Alonso",
title = "Data processing on {FPGAs}",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "910--921",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Abouzeid:2009:HAH,
author = "Azza Abouzeid and Kamil Bajda-Pawlikowski and Daniel
Abadi and Avi Silberschatz and Alexander Rasin",
title = "{HadoopDB}: an architectural hybrid of {MapReduce} and
{DBMS} technologies for analytical workloads",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "922--933",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{He:2009:ASV,
author = "Yeye He and Jeffrey F. Naughton",
title = "Anonymization of set-valued data via top-down, local
generalization",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "934--945",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Zou:2009:AGF,
author = "Lei Zou and Lei Chen and M. Tamer {\"O}zsu",
title = "$k$-automorphism: a general framework for privacy
preserving network publication",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "946--957",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Koudas:2009:DBM,
author = "Nick Koudas and Divesh Srivastava and Ting Yu and Qing
Zhang",
title = "Distribution based microdata anonymization",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "958--969",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Meier:2009:CTB,
author = "Michael Meier and Michael Schmidt and Georg Lausen",
title = "On chase termination beyond stratification",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "970--981",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Moerkotte:2009:PBP,
author = "Guido Moerkotte and Thomas Neumann and Gabriele
Steidl",
title = "Preventing bad plans by bounding the impact of
cardinality estimation errors",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "982--993",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Chaudhuri:2009:ECQ,
author = "Surajit Chaudhuri and Vivek Narasayya and Ravi
Ramamurthy",
title = "Exact cardinality query optimization for optimizer
testing",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "994--1005",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{tenCate:2009:LSM,
author = "Balder ten Cate and Laura Chiticariu and Phokion
Kolaitis and Wang-Chiew Tan",
title = "Laconic schema mappings: computing the core with {SQL}
queries",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "1006--1017",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Arenas:2009:ISM,
author = "Marcelo Arenas and Jorge P{\'e}rez and Juan Reutter
and Cristian Riveros",
title = "Inverting schema mappings: bridging the gap between
theory and practice",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "1018--1029",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Terwilliger:2009:FFF,
author = "James F. Terwilliger and Philip A. Bernstein and
Sergey Melnik",
title = "Full-fidelity flexible object-oriented {XML} access",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "1030--1041",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Wang:2009:PAM,
author = "Ting Wang and Ling Liu",
title = "Privacy-aware mobile services over road networks",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "1042--1053",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{U:2009:FAA,
author = "Leong Hou U. and Nikos Mamoulis and Kyriakos
Mouratidis",
title = "A fair assignment algorithm for multiple preference
queries",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "1054--1065",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Mishima:2009:PED,
author = "Takeshi Mishima and Hiroshi Nakamura",
title = "Pangea: an eager database replication middleware
guaranteeing snapshot isolation without modification of
database servers",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "1066--1077",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Elmeleegy:2009:HRT,
author = "Hazem Elmeleegy and Jayant Madhavan and Alon Halevy",
title = "Harvesting relational tables from lists on the web",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "1078--1089",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Cafarella:2009:DIR,
author = "Michael J. Cafarella and Alon Halevy and Nodira
Khoussainova",
title = "Data integration for the relational web",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "1090--1101",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Gottlob:2009:NOS,
author = "Georg Gottlob and Reinhard Pichler and Vadim
Savenkov",
title = "Normalization and optimization of schema mappings",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "1102--1113",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Xing:2009:CMN,
author = "Songhua Xing and Cyrus Shahabi and Bei Pan",
title = "Continuous monitoring of nearest neighbors on land
surface",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "1114--1125",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Wong:2009:EMM,
author = "Raymond Chi-Wing Wong and M. Tamer {\"O}zsu and Philip
S. Yu and Ada Wai-Chee Fu and Lian Liu",
title = "Efficient method for maximizing bichromatic reverse
nearest neighbor",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "1126--1137",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Cheema:2009:LUE,
author = "Muhammad Aamir Cheema and Xuemin Lin and Ying Zhang
and Wei Wang and Wenjie Zhang",
title = "Lazy updates: an efficient technique to continuously
monitoring reverse {kNN}",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "1138--1149",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Chen:2009:NMM,
author = "Ling Chen and Sourav S. Bhowmick and Wolfgang Nejdl",
title = "{NEAR-Miner}: mining evolution associations of {Web}
site directories for efficient maintenance of {Web}
archives",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "1150--1161",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Wong:2009:AEO,
author = "W. K. Wong and David W. Cheung and Edward Hung and Ben
Kao and Nikos Mamoulis",
title = "An audit environment for outsourcing of frequent
itemset mining",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "1162--1173",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Mozafari:2009:PNB,
author = "Barzan Mozafari and Carlo Zaniolo",
title = "Publishing naive {Bayesian} classifiers: privacy
without accuracy loss",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "1174--1185",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Tzoumas:2009:WAI,
author = "Kostas Tzoumas and Man Lung Yiu and Christian S.
Jensen",
title = "Workload-aware indexing of continuously moving
objects",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "1186--1197",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Zhang:2009:EIU,
author = "Meihui Zhang and Su Chen and Christian S. Jensen and
Beng Chin Ooi and Zhenjie Zhang",
title = "Effectively indexing uncertain moving objects for
predictive queries",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "1198--1209",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Sankaranarayanan:2009:POS,
author = "Jagan Sankaranarayanan and Hanan Samet and Houman
Alborzi",
title = "Path oracles for spatial networks",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "1210--1221",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Kimura:2009:CMC,
author = "Hideaki Kimura and George Huo and Alexander Rasin and
Samuel Madden and Stanley B. Zdonik",
title = "Correlation maps: a compressed access method for
exploiting soft functional dependencies",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "1222--1233",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Schnaitter:2009:IIP,
author = "Karl Schnaitter and Neoklis Polyzotis and Lise
Getoor",
title = "Index interactions in physical design tuning:
modeling, analysis, and applications",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "1234--1245",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Duan:2009:TDC,
author = "Songyun Duan and Vamsidhar Thummala and Shivnath
Babu",
title = "Tuning database configuration parameters with
{iTuned}",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "1246--1257",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Salles:2009:ECR,
author = "Marcos Vaz Salles and Tuan Cao and Benjamin Sowell and
Alan Demers and Johannes Gehrke and Christoph Koch and
Walker White",
title = "An evaluation of checkpoint recovery for massively
multiplayer online games",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "1258--1269",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Muller:2009:ECS,
author = "Emmanuel M{\"u}ller and Stephan G{\"u}nnemann and Ira
Assent and Thomas Seidl",
title = "Evaluating clustering in subspace projections of high
dimensional data",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "1270--1281",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Hassanzadeh:2009:FEC,
author = "Oktie Hassanzadeh and Fei Chiang and Hyun Chul Lee and
Ren{\'e}e J. Miller",
title = "Framework for evaluating clustering algorithms in
duplicate detection",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "1282--1293",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Guo:2009:DMM,
author = "Hongfei Guo and Dan Jones and Jennifer Beckmann and
Praveen Seshadri",
title = "Declarative management in {Microsoft SQL} server",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "2",
pages = "1294--1305",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:57 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{El-Helw:2009:SRS,
author = "Amr El-Helw and Ihab F. Ilyas and Calisto Zuzarte",
title = "{StatAdvisor}: recommending statistical views",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "2",
pages = "1306--1317",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:57 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Canim:2009:OPA,
author = "Mustafa Canim and George A. Mihaila and Bishwaranjan
Bhattacharjee and Kenneth A. Ross and Christian A.
Lang",
title = "An object placement advisor for {DB2} using solid
state storage",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "2",
pages = "1318--1329",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:57 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Bhide:2009:XXP,
author = "Manish Bhide and Manoj K. Agarwal and Amir Bar-Or and
Sriram Padmanabhan and Srinivas K. Mittapalli and
Girish Venkatachaliah",
title = "{XPEDIA}: {XML} processing for data integration",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "2",
pages = "1330--1341",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:57 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Bamford:2009:XR,
author = "Roger Bamford and Vinayak Borkar and Matthias Brantner
and Peter M. Fischer and Daniela Florescu and David
Graf and Donald Kossmann and Tim Kraska and Dan Muresan
and Sorin Nasoi and Markos Zacharioudakis",
title = "{XQuery} reloaded",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "2",
pages = "1342--1353",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:57 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Zhang:2009:BXS,
author = "Ning Zhang and Nipun Agarwal and Sivasankaran
Chandrasekar and Sam Idicula and Vijay Medi and Sabina
Petride and Balasubramanyam Sthanikam",
title = "Binary {XML} storage and query processing in {Oracle
11g}",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "2",
pages = "1354--1365",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:57 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Bellamkonda:2009:ESO,
author = "Srikanth Bellamkonda and Rafi Ahmed and Andrew
Witkowski and Angela Amor and Mohamed Zait and
Chun-Chieh Lin",
title = "Enhanced subquery optimizations in {Oracle}",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "2",
pages = "1366--1377",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:57 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Kim:2009:SVH,
author = "Changkyu Kim and Tim Kaldewey and Victor W. Lee and
Eric Sedlar and Anthony D. Nguyen and Nadathur Satish
and Jatin Chhugani and Andrea {Di Blas} and Pradeep
Dubey",
title = "Sort vs. {Hash} revisited: fast join implementation on
modern multi-core {CPUs}",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "2",
pages = "1378--1389",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:57 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Xu:2009:EOJ,
author = "Yu Xu and Pekka Kostamaa",
title = "Efficient outer join data skew handling in parallel
{DBMS}",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "2",
pages = "1390--1396",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:57 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Friedman:2009:SMP,
author = "Eric Friedman and Peter Pawlowski and John
Cieslewicz",
title = "{SQL\slash MapReduce}: a practical approach to
self-describing, polymorphic, and parallelizable
user-defined functions",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "2",
pages = "1402--1413",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:57 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Gates:2009:BHL,
author = "Alan F. Gates and Olga Natkovich and Shubham Chopra
and Pradeep Kamath and Shravan M. Narayanamurthy and
Christopher Olston and Benjamin Reed and Santhosh
Srinivasan and Utkarsh Srivastava",
title = "Building a high-level dataflow system on top of
{Map-Reduce}: the {Pig} experience",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "2",
pages = "1414--1425",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:57 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Panda:2009:PMP,
author = "Biswanath Panda and Joshua S. Herbach and Sugato Basu
and Roberto J. Bayardo",
title = "{PLANET}: massively parallel learning of tree
ensembles with {MapReduce}",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "2",
pages = "1426--1437",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:57 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Legler:2009:RDT,
author = "Thomas Legler and Wolfgang Lehner and Jan Schaffner
and Jens Kr{\"u}ger",
title = "Robust and distributed top-n frequent-pattern mining
with {SAP BW} accelerator",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "2",
pages = "1438--1449",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:57 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Dieu:2009:TUF,
author = "Nicolas Dieu and Adrian Dragusanu and Fran{\c{c}}oise
Fabret and Fran{\c{c}}ois Llirbat and Eric Simon",
title = "1,000 tables under the form",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "2",
pages = "1450--1461",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:57 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Bhattacharjee:2009:EIC,
author = "Bishwaranjan Bhattacharjee and Lipyeow Lim and Timothy
Malkemus and George Mihaila and Kenneth Ross and
Sherman Lau and Cathy McArthur and Zoltan Toth and Reza
Sherkat",
title = "Efficient index compression in {DB2 LUW}",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "2",
pages = "1462--1473",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:57 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Lacroix:2009:SSW,
author = "Zo{\'e} Lacroix and Christophe Legendre and Spyro
Mousses",
title = "Storing scientific workflows in a database",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "2",
pages = "1474--1480",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:57 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Cohen:2009:MSN,
author = "Jeffrey Cohen and Brian Dolan and Mark Dunlap and
Joseph M. Hellerstein and Caleb Welton",
title = "{MAD} skills: new analysis practices for big data",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "2",
pages = "1481--1492",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:57 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Ley:2009:DSL,
author = "Michael Ley",
title = "{DBLP}: some lessons learned",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "2",
pages = "1493--1500",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:57 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Mukherjee:2009:OSP,
author = "Niloy Mukherjee and Amit Ganesh and Vinayagam
Djegaradjane and Sujatha Muthulingam and Wei Zhang and
Krishna Kunchithapadam and Scott Lynn and Bharath Aleti
and Kam Shergill and Shaoyu Wang",
title = "{Oracle SecureFiles}: prepared for the digital
deluge",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "2",
pages = "1501--1511",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:57 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Baumgartner:2009:SWD,
author = "Robert Baumgartner and Georg Gottlob and Marcus
Herzog",
title = "Scalable {Web} data extraction for online market
intelligence",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "2",
pages = "1512--1523",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:57 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Rajaraman:2009:KHP,
author = "Anand Rajaraman",
title = "{Kosmix}: high-performance topic exploration using the
deep {Web}",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "2",
pages = "1524--1529",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:57 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Nehme:2009:QMM,
author = "Rimma V. Nehme and Karen E. Works and Elke A.
Rundensteiner and Elisa Bertino",
title = "Query mesh: multi-route query processing technology",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "2",
pages = "1530--1533",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:57 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Cudre-Mauroux:2009:DSS,
author = "P. Cudre-Mauroux and H. Kimura and K.-T. Lim and J.
Rogers and R. Simakov and E. Soroush and P. Velikhov
and D. L. Wang and M. Balazinska and J. Becla and D.
DeWitt and B. Heath and D. Maier and S. Madden and J.
Patel and M. Stonebraker and S. Zdonik",
title = "A demonstration of {SciDB}: a science-oriented
{DBMS}",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "2",
pages = "1534--1537",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:57 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Liu:2009:MMM,
author = "Kuien Liu and Ke Deng and Zhiming Ding and Mingshu Li
and Xiaofang Zhou",
title = "{MOIR\slash MT}: monitoring large-scale road network
traffic in real-time",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "2",
pages = "1538--1541",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:57 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Colle:2009:ODR,
author = "Romain Colle and Leonidas Galanis and Supiti
Buranawatanachoke and Stratos Papadomanolakis and Yujun
Wang",
title = "{Oracle Database Replay}",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "2",
pages = "1542--1545",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:57 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Borisov:2009:DPD,
author = "Nedyalko Borisov and Shivnath Babu and Sandeep
Uttamchandani and Ramani Routray and Aameek Singh",
title = "{DIADS}: a problem diagnosis tool for databases and
storage area networks",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "2",
pages = "1546--1549",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:57 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Herschel:2009:ASA,
author = "Melanie Herschel and Mauricio A. Hern{\'a}ndez and
Wang-Chiew Tan",
title = "{Artemis}: a system for analyzing missing answers",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "2",
pages = "1550--1553",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:57 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Wu:2009:DTS,
author = "Eugene Wu and Philippe Cudre-Mauroux and Samuel
Madden",
title = "Demonstration of the {TrajStore} system",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "2",
pages = "1554--1557",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:57 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Ali:2009:MCS,
author = "M. H. Ali and C. Gerea and B. S. Raman and B. Sezgin
and T. Tarnavski and T. Verona and P. Wang and P.
Zabback and A. Ananthanarayan and A. Kirilov and M. Lu
and A. Raizman and R. Krishnan and R. Schindlauer and
T. Grabs and S. Bjeletich and B. Chandramouli and J.
Goldstein and S. Bhat and Ying Li and V. {Di Nicola}
and X. Wang and David Maier and S. Grell and O. Nano
and I. Santos",
title = "{Microsoft CEP Server} and online behavioral
targeting",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "2",
pages = "1558--1561",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:57 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Krompass:2009:TMD,
author = "Stefan Krompass and Harumi Kuno and Janet L. Wiener
and Kevin Wilkinson and Umeshwar Dayal and Alfons
Kemper",
title = "A testbed for managing dynamic mixed workloads",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "2",
pages = "1562--1565",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:57 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Ahmad:2009:DSC,
author = "Yanif Ahmad and Christoph Koch",
title = "{DBToaster}: a {SQL} compiler for high-performance
delta processing in main-memory databases",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "2",
pages = "1566--1569",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:57 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Preda:2009:AAK,
author = "Nicoleta Preda and Fabian M. Suchanek and Gjergji
Kasneci and Thomas Neumann and Maya Ramanath and
Gerhard Weikum",
title = "{ANGIE}: active knowledge for interactive
exploration",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "2",
pages = "1570--1573",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:57 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Kopcke:2009:CEE,
author = "Hanna K{\"o}pcke and Andreas Thor and Erhard Rahm",
title = "Comparative evaluation of entity resolution approaches
with {FEVER}",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "2",
pages = "1574--1577",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:57 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Brauer:2009:RDR,
author = "Falk Brauer and Wojciech Barczynski and Gregor
Hackenbroich and Marcus Schramm and Adrian Mocan and
Felix F{\"o}rster",
title = "{RankIE}: document retrieval on ranked entity graphs",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "2",
pages = "1578--1581",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:57 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Mecca:2009:CEM,
author = "Giansalvatore Mecca and Paolo Papotti and Salvatore
Raunich and Marcello Buoncristiano",
title = "Concise and expressive mappings with +Spicy",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "2",
pages = "1582--1585",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:57 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Cruz:2009:AEM,
author = "Isabel F. Cruz and Flavio Palandri Antonelli and
Cosmin Stroe",
title = "{AgreementMaker}: efficient matching for large
real-world schemas and ontologies",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "2",
pages = "1586--1589",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:57 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Hassanzadeh:2009:LQW,
author = "Oktie Hassanzadeh and Reynold Xin and Ren{\'e}e J.
Miller and Anastasios Kementsietsidis and Lipyeow Lim
and Min Wang",
title = "{Linkage Query Writer}",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "2",
pages = "1590--1593",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:57 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Wang:2009:SEE,
author = "Xiaoyuan Wang and Xingzhi Sun and Feng Cao and Li Ma
and Nick Kanellos and Kang Zhang and Yue Pan and Yong
Yu",
title = "{SMDM}: enhancing enterprise-wide master data
management using semantic {Web} technologies",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "2",
pages = "1594--1597",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:57 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Gubanov:2009:IUR,
author = "Michael N. Gubanov and Lucian Popa and Howard Ho and
Hamid Pirahesh and Jeng-Yih Chang and Shr-Chang Chen",
title = "{IBM UFO} repository: object-oriented data
integration",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "2",
pages = "1598--1601",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:57 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Chen:2009:MSW,
author = "Huajun Chen and Bin Lu and Yuan Ni and Guotong Xie and
Chunying Zhou and Jinhua Mi and Zhaohui Wu",
title = "Mashup by surfing a {Web} of data {APIs}",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "2",
pages = "1602--1605",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:57 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Pichler:2009:DDE,
author = "Reinhard Pichler and Vadim Savenkov",
title = "{DEMo}: data exchange modeling tool",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "2",
pages = "1606--1609",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:57 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Letchner:2009:LDW,
author = "Julie Letchner and Christopher R{\'e} and Magdalena
Balazinska and Matthai Philipose",
title = "Lahar demonstration: warehousing {Markovian} streams",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "2",
pages = "1610--1613",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:57 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Sun:2009:WAC,
author = "Peng Sun and Ziyang Liu and Sivaramakrishnan Natarajan
and Susan B. Davidson and Yi Chen",
title = "{WOLVES}: achieving correct provenance analysis by
detecting and resolving unsound workflow views",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "2",
pages = "1614--1617",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:57 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Dai:2009:TTI,
author = "Chenyun Dai and Gabriel Ghinita and Elisa Bertino and
Ji-Won Byun and Ninghui Li",
title = "{TIAMAT}: a tool for interactive analysis of microdata
anonymization techniques",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "2",
pages = "1618--1621",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:57 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Yu:2009:IIN,
author = "Yintao Yu and Cindy X. Lin and Yizhou Sun and Chen
Chen and Jiawei Han and Binbin Liao and Tianyi Wu and
ChengXiang Zhai and Duo Zhang and Bo Zhao",
title = "{iNextCube}: information network-enhanced text cube",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "2",
pages = "1622--1625",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:57 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Thusoo:2009:HWS,
author = "Ashish Thusoo and Joydeep Sen Sarma and Namit Jain and
Zheng Shao and Prasad Chakka and Suresh Anthony and Hao
Liu and Pete Wyckoff and Raghotham Murthy",
title = "{Hive}: a warehousing solution over a map-reduce
framework",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "2",
pages = "1626--1629",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:57 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Satish:2009:TEB,
author = "Arjun Satish and Ramesh Jain and Amarnath Gupta",
title = "{Tolkien}: an event based storytelling system",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "2",
pages = "1630--1633",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:57 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Sarigol:2009:ESN,
author = "Emre Sarig{\"o}l and Oriana Riva and Patrick Stuedi
and Gustavo Alonso",
title = "Enabling social networking in ad hoc networks of
mobile phones",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "2",
pages = "1634--1637",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:57 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Bao:2009:PVD,
author = "Zhuowei Bao and Sarah Cohen-Boulakia and Susan B.
Davidson and Pierrick Girard",
title = "{PDiffView}: viewing the difference in provenance of
workflow results",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "2",
pages = "1638--1641",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:57 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Deutch:2009:GOW,
author = "Daniel Deutch and Tova Milo and Tom Yam",
title = "Goal-oriented {Web}-site navigation for on-line
shoppers",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "2",
pages = "1642--1645",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:57 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Pereira:2009:AWQ,
author = "Fernando Pereira and Anand Rajaraman and Sunita
Sarawagi and William Tunstall-Pedoe and Gerhard Weikum
and Alon Halevy",
title = "Answering {Web} questions using structured data: dream
or reality?",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "2",
pages = "1646--1646",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:57 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Bernstein:2009:HBB,
author = "Philip A. Bernstein and Daniel J. Abadi and Michael J.
Cafarella and Joseph M. Hellerstein and Donald Kossmann
and Samuel Madden",
title = "How best to build {Web}-scale data managers?",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "2",
pages = "1647--1647",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:57 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Manegold:2009:DAE,
author = "Stefan Manegold and Martin L. Kersten and Peter
Boncz",
title = "Database architecture evolution: mammals flourished
long before dinosaurs became extinct",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "2",
pages = "1648--1653",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:57 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Dong:2009:DFR,
author = "Xin Luna Dong and Felix Naumann",
title = "Data fusion: resolving data conflicts for
integration",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "2",
pages = "1654--1655",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:57 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Heer:2009:DVS,
author = "Jeffrey Heer and Joseph M. Hellerstein",
title = "Data visualization and social data analysis",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "2",
pages = "1656--1657",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:57 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Chaudhuri:2009:KQR,
author = "Surajit Chaudhuri and Gautam Das",
title = "Keyword querying and ranking in databases",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "2",
pages = "1658--1659",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:57 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Hadjieleftheriou:2009:EAS,
author = "Marios Hadjieleftheriou and Chen Li",
title = "Efficient approximate search on string collections",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "2",
pages = "1660--1661",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:57 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Srivastava:2009:ITD,
author = "Divesh Srivastava and Suresh Venkatasubramanian",
title = "Information theory for data management",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "2",
pages = "1662--1663",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:57 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Abadi:2009:COD,
author = "Daniel J. Abadi and Peter A. Boncz and Stavros
Harizopoulos",
title = "Column-oriented database systems",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "2",
pages = "1664--1665",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:54:57 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Srivastava:2010:ERT,
author = "Divesh Srivastava and Lukasz Golab and Rick Greer and
Theodore Johnson and Joseph Seidel and Vladislav
Shkapenyuk and Oliver Spatscheck and Jennifer Yates",
title = "Enabling real time data analysis",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1--2",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Matsudaira:2010:HEB,
author = "Paul Matsudaira",
title = "High-end biological imaging generates very large
{$3$D+} and dynamic datasets",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "3--3",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Cho:2010:DWD,
author = "Junghoo Cho and Hector Garcia-Molina",
title = "Dealing with {Web} data: history and look ahead",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "4--4",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
remark = "10-year best paper award",
}
@Article{Kemme:2010:DRT,
author = "Bettina Kemme and Gustavo Alonso",
title = "Database replication: a tale of research across
communities",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "5--12",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
remark = "10-year best paper award",
}
@Article{Canim:2010:BDR,
author = "Mustafa Canim and Murat Kantarcio{\u{g}}lu and Bijit
Hore and Sharad Mehrotra",
title = "Building disclosure risk aware query optimizers for
relational databases",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "13--24",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Allard:2010:SPD,
author = "Tristan Allard and Nicolas Anciaux and Luc Bouganim
and Yanli Guo and Lionel Le Folgoc and Benjamin Nguyen
and Philippe Pucheral and Indrajit Ray and Indrakshi
Ray and Shaoyi Yin",
title = "Secure personal data servers: a vision paper",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "25--35",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Fabbri:2010:PMR,
author = "Daniel Fabbri and Kristen LeFevre and Qiang Zhu",
title = "{PolicyReplay}: misconfiguration-response queries for
data breach reporting",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "36--47",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Curino:2010:SWD,
author = "Carlo Curino and Evan Jones and Yang Zhang and Sam
Madden",
title = "{Schism}: a workload-driven approach to database
replication and partitioning",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "48--57",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Qin:2010:TTS,
author = "Lu Qin and Jeffrey Xu Yu and Lijun Chang",
title = "Ten thousand {SQLs}: parallel keyword queries
computing",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "58--69",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Thomson:2010:CDD,
author = "Alexander Thomson and Daniel J. Abadi",
title = "The case for determinism in database systems",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "70--80",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Alexe:2010:MCI,
author = "Bogdan Alexe and Mauricio Hern{\'a}ndez and Lucian
Popa and Wang-Chiew Tan",
title = "{MapMerge}: correlating independent schema mappings",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "81--92",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Greco:2010:CTC,
author = "Sergio Greco and Francesca Spezzano",
title = "Chase termination: a constraints rewriting approach",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "93--104",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Marnette:2010:SDE,
author = "Bruno Marnette and Giansalvatore Mecca and Paolo
Papotti",
title = "Scalable data exchange with functional dependencies",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "105--116",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Kanza:2010:IRS,
author = "Yaron Kanza and Roy Levin and Eliyahu Safra and
Yehoshua Sagiv",
title = "Interactive route search in the presence of order
constraints",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "117--128",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Lang:2010:EMM,
author = "Willis Lang and Jignesh M. Patel",
title = "Energy management for {MapReduce} clusters",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "129--139",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Baid:2010:TSK,
author = "Akanksha Baid and Ian Rae and Jiexing Li and AnHai
Doan and Jeffrey Naughton",
title = "Toward scalable keyword search over relational data",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "140--149",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Mozafari:2010:REN,
author = "Barzan Mozafari and Kai Zeng and Carlo Zaniolo",
title = "From regular expressions to nested words: unifying
languages and query execution for relational and {XML}
sequences",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "150--161",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Grust:2010:ASL,
author = "Torsten Grust and Jan Rittinger and Tom Schreiber",
title = "Avalanche-safe {LINQ} compilation",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "162--172",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Fan:2010:TCF,
author = "Wenfei Fan and Jianzhong Li and Shuai Ma and Nan Tang
and Wenyuan Yu",
title = "Towards certain fixes with editing rules and master
data",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "173--184",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Herschel:2010:EMA,
author = "Melanie Herschel and Mauricio A. Hern{\'a}ndez",
title = "Explaining missing answers to {SPJUA} queries",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "185--196",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Beskales:2010:SRF,
author = "George Beskales and Ihab F. Ilyas and Lukasz Golab",
title = "Sampling the repairs of functional dependency
violations under hard constraints",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "197--207",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Menestrina:2010:EER,
author = "David Menestrina and Steven Euijong Whang and Hector
Garcia-Molina",
title = "Evaluating entity resolution results",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "208--219",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Chandramouli:2010:HPD,
author = "Badrish Chandramouli and Jonathan Goldstein and David
Maier",
title = "High-performance dynamic pattern matching over
disordered streams",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "220--231",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Botan:2010:SMA,
author = "Irina Botan and Roozbeh Derakhshan and Nihal Dindar
and Laura Haas and Ren{\'e}e J. Miller and Nesime
Tatbul",
title = "{SECRET}: a model for analysis of the execution
semantics of stream processing systems",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "232--243",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Zhang:2010:RPS,
author = "Haopeng Zhang and Yanlei Diao and Neil Immerman",
title = "Recognizing patterns in streams with imprecise
timestamps",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "244--255",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Neumann:2010:XRF,
author = "Thomas Neumann and Gerhard Weikum",
title = "{x-RDF-3X}: fast querying, high update rates, and
consistency for {RDF} databases",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "256--263",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Fan:2010:GPM,
author = "Wenfei Fan and Jianzhong Li and Shuai Ma and Nan Tang
and Yinghui Wu and Yunpeng Wu",
title = "Graph pattern matching: from intractable to polynomial
time",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "264--275",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Yildirim:2010:GSR,
author = "Hilmi Yildirim and Vineet Chaoji and Mohammed J.
Zaki",
title = "{GRAIL}: scalable reachability index for large
graphs",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "276--284",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Bu:2010:HEI,
author = "Yingyi Bu and Bill Howe and Magdalena Balazinska and
Michael D. Ernst",
title = "{HaLoop}: efficient iterative data processing on large
clusters",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "285--296",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Benedikt:2010:IVV,
author = "Michael Benedikt and Georg Gottlob",
title = "The impact of virtual views on containment",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "297--308",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Terwilliger:2010:UET,
author = "James F. Terwilliger and Lois M. L. Delcambre and
David Maier and Jeremy Steinhauer and Scott Britell",
title = "Updatable and evolvable transforms for virtual
databases",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "309--319",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Deutch:2010:NCM,
author = "Daniel Deutch and Ohad Greenshpan and Tova Milo",
title = "Navigating in complex mashed-up applications",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "320--329",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Melnik:2010:DIA,
author = "Sergey Melnik and Andrey Gubarev and Jing Jing Long
and Geoffrey Romer and Shiva Shivakumar and Matt Tolton
and Theo Vassilakis",
title = "{Dremel}: interactive analysis of {Web}-scale
datasets",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "330--339",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Zhao:2010:GQO,
author = "Peixiang Zhao and Jiawei Han",
title = "On graph query optimization in large networks",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "340--351",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Martinenghi:2010:PRJ,
author = "Davide Martinenghi and Marco Tagliasacchi",
title = "Proximity rank join",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "352--363",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Vlachou:2010:IMI,
author = "Akrivi Vlachou and Christos Doulkeridis and Kjetil
N{\o}rv{\aa}g and Yannis Kotidis",
title = "Identifying the most influential data objects with
reverse top-$k$ queries",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "364--372",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Cao:2010:RTP,
author = "Xin Cao and Gao Cong and Christian S. Jensen",
title = "Retrieving top-$k$ prestige-based relevant spatial
{Web} objects",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "373--384",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Li:2010:PLF,
author = "Lei Li and B. Aditya Prakash and Christos Faloutsos",
title = "Parsimonious linear fingerprinting for time series",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "385--396",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Zhang:2010:HTM,
author = "Rui Zhang and Martin Stradling",
title = "The {HV-tree}: a memory hierarchy aware version
index",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "397--408",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Pramanik:2010:TRQ,
author = "Sakti Pramanik and Alok Watve and Chad R. Meiners and
Alex Liu",
title = "Transforming range queries to equivalent box queries
to optimize page access",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "409--416",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Guo:2010:RLU,
author = "Songtao Guo and Xin Luna Dong and Divesh Srivastava
and Remi Zajac",
title = "Record linkage with uniqueness constraints and
erroneous values",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "417--428",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Ioannou:2010:FEA,
author = "Ekaterini Ioannou and Wolfgang Nejdl and Claudia
Nieder{\'e}e and Yannis Velegrakis",
title = "On-the-fly entity-aware query processing in the
presence of linkage",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "429--438",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Yakout:2010:BBR,
author = "Mohamed Yakout and Ahmed K. Elmagarmid and Hazem
Elmeleegy and Mourad Ouzzani and Alan Qi",
title = "Behavior based record linkage",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "439--448",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Han:2010:IFC,
author = "Wook-Shin Han and Jinsoo Lee and Minh-Duc Pham and
Jeffrey Xu Yu",
title = "{iGraph}: a framework for comparisons of disk-based
graph indexing techniques",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "449--459",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Schad:2010:RMC,
author = "J{\"o}rg Schad and Jens Dittrich and Jorge-Arnulfo
Quian{\'e}-Ruiz",
title = "Runtime measurements in the cloud: observing,
analyzing, and reducing variance",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "460--471",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Jiang:2010:PMD,
author = "Dawei Jiang and Beng Chin Ooi and Lei Shi and Sai Wu",
title = "The performance of {MapReduce}: an in-depth study",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "472--483",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Kopcke:2010:EER,
author = "Hanna K{\"o}pcke and Andreas Thor and Erhard Rahm",
title = "Evaluation of entity resolution approaches on
real-world match problems",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "484--493",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Nykiel:2010:MSA,
author = "Tomasz Nykiel and Michalis Potamias and Chaitanya
Mishra and George Kollios and Nick Koudas",
title = "{MRShare}: sharing across multiple queries in
{MapReduce}",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "494--505",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Vo:2010:TET,
author = "Hoang Tam Vo and Chun Chen and Beng Chin Ooi",
title = "Towards elastic transactional cloud storage with range
query support",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "506--514",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Dittrich:2010:HMY,
author = "Jens Dittrich and Jorge-Arnulfo Quian{\'e}-Ruiz and
Alekh Jindal and Yagiz Kargin and Vinay Setty and
J{\"o}rg Schad",
title = "{Hadoop++}: making a yellow elephant run like a
cheetah (without it even noticing)",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "515--529",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Bruno:2010:SLR,
author = "Nicolas Bruno and Vivek Narasayya and Ravi
Ramamurthy",
title = "Slicing long-running queries",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "530--541",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Tzoumas:2010:SAH,
author = "Kostas Tzoumas and Amol Deshpande and Christian S.
Jensen",
title = "Sharing-aware horizontal partitioning for exploiting
correlations during query processing",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "542--553",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Cali:2010:APO,
author = "Andrea Cal{\`\i} and Georg Gottlob and Andreas
Pieris",
title = "Advanced processing for ontological queries",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "554--565",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Parameswaran:2010:TWC,
author = "Aditya Parameswaran and Hector Garcia-Molina and Anand
Rajaraman",
title = "Towards the {Web} of concepts: extracting concepts
from large datasets",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "566--577",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Gulhane:2010:ECR,
author = "Pankaj Gulhane and Rajeev Rastogi and Srinivasan H.
Sengamedu and Ashwin Tengli",
title = "Exploiting content redundancy for {Web} information
extraction",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "578--587",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Liu:2010:ARR,
author = "Bin Liu and Laura Chiticariu and Vivian Chu and H. V.
Jagadish and Frederick R. Reiss",
title = "Automatic rule refinement for information extraction",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "588--597",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Pang:2010:ETS,
author = "HweeHwa Pang and Xuhua Ding and Xiaokui Xiao",
title = "Embellishing text search queries to protect user
privacy",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "598--607",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Chaytor:2010:SDR,
author = "Rhonda Chaytor and Ke Wang",
title = "Small domain randomization: same privacy, more
utility",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "608--618",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Papadopoulos:2010:NNS,
author = "Stavros Papadopoulos and Spiridon Bakiras and Dimitris
Papadias",
title = "Nearest neighbor search with strong location privacy",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "619--629",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Kimura:2010:UPI,
author = "Hideaki Kimura and Samuel Madden and Stanley B.
Zdonik",
title = "{UPI}: a primary index for uncertain databases",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "630--637",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Li:2010:RCP,
author = "Jian Li and Amol Deshpande",
title = "Ranking continuous probabilistic datasets",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "638--649",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Lian:2010:SSJ,
author = "Xiang Lian and Lei Chen",
title = "Set similarity join on probabilistic data",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "650--659",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Woods:2010:CED,
author = "Louis Woods and Jens Teubner and Gustavo Alonso",
title = "Complex event detection at wire speed with {FPGAs}",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "660--669",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Fang:2010:DCG,
author = "Wenbin Fang and Bingsheng He and Qiong Luo",
title = "Database compression on graphics processors",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "670--680",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Johnson:2010:ASA,
author = "Ryan Johnson and Ippokratis Pandis and Radu Stoica and
Manos Athanassoulis and Anastasia Ailamaki",
title = "{Aether}: a scalable approach to logging",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "681--692",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Macropol:2010:SDB,
author = "Kathy Macropol and Ambuj Singh",
title = "Scalable discovery of best clusters on large graphs",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "693--702",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Smola:2010:APT,
author = "Alexander Smola and Shravan Narayanamurthy",
title = "An architecture for parallel topic models",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "703--710",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Ganti:2010:KFI,
author = "Venkatesh Ganti and Yeye He and Dong Xin",
title = "{Keyword++}: a framework to improve keyword search
over entity databases",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "711--722",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Li:2010:SMR,
author = "Zhenhui Li and Bolin Ding and Jiawei Han and Roland
Kays",
title = "{Swarm}: mining relaxed temporal moving object
clusters",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "723--734",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Chen:2010:AUP,
author = "Su Chen and Beng Chin Ooi and Zhenjie Zhang",
title = "An adaptive updating protocol for reducing moving
object database workload",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "735--746",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Kellaris:2010:SPC,
author = "Georgios Kellaris and Kyriakos Mouratidis",
title = "Shortest path computation on air indexes",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "747--757",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Xu:2010:EES,
author = "Jia Xu and Zhenjie Zhang and Anthony K. H. Tung and Ge
Yu",
title = "Efficient and effective similarity search over
probabilistic data based on {Earth Mover's Distance}",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "758--769",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Benedikt:2010:PXM,
author = "Michael Benedikt and Evgeny Kharlamov and Dan Olteanu
and Pierre Senellart",
title = "Probabilistic {XML} via {Markov Chains}",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "770--781",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Arumugam:2010:MRR,
author = "Subi Arumugam and Fei Xu and Ravi Jampani and
Christopher Jermaine and Luis L. Perez and Peter J.
Haas",
title = "{MCDB-R}: risk analysis in the database",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "782--793",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Wick:2010:SPD,
author = "Michael Wick and Andrew McCallum and Gerome Miklau",
title = "Scalable probabilistic databases with factor graphs
and {MCMC}",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "794--804",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Zhang:2010:MCF,
author = "Meihui Zhang and Marios Hadjieleftheriou and Beng Chin
Ooi and Cecilia M. Procopiuc and Divesh Srivastava",
title = "On multi-column foreign key discovery",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "805--814",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Cheng:2010:EEE,
author = "Reynold Cheng and Eric Lo and Xuan S. Yang and
Ming-Hay Luk and Xiang Li and Xike Xie",
title = "Explore or exploit?: effective strategies for
disambiguating large databases",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "815--825",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Soliman:2010:BRM,
author = "Mohamed A. Soliman and Ihab F. Ilyas and Mina Saleeb",
title = "Building ranked mashups of unstructured sources with
uncertain information",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "826--837",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Raissi:2010:CCS,
author = "Chedy Ra{\"\i}ssi and Jian Pei and Thomas Kister",
title = "Computing closed skycubes",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "838--847",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Lo:2010:GDQ,
author = "Eric Lo and Nick Cheng and Wing-Kai Hon",
title = "Generating databases for query workloads",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "848--859",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Wu:2010:PTJ,
author = "Minji Wu and Laure Berti-{\'E}quille and Am{\'e}lie
Marian and Cecilia M. Procopiuc and Divesh Srivastava",
title = "Processing top-$k$ join queries",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "860--870",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Martinez-Palau:2010:TWR,
author = "Xavier Martinez-Palau and David Dominguez-Sal and
Josep Lluis Larriba-Pey",
title = "Two-way replacement selection",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "871--881",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Maneth:2010:XWQ,
author = "Sebastian Maneth and Kim Nguyen",
title = "{XPath} whole query optimization",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "882--893",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Grimsmo:2010:FOT,
author = "Nils Grimsmo and Truls A. Bj{\o}rklund and Magnus Lie
Hetland",
title = "Fast optimal twig joins",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "894--905",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Benedikt:2010:DIX,
author = "Michael Benedikt and James Cheney",
title = "Destabilizers and independence of {XML} updates",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "906--917",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Liu:2010:SWH,
author = "Ziyang Liu and Qihong Shao and Yi Chen",
title = "Searching workflows with hierarchical views",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "918--927",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Pandis:2010:DOT,
author = "Ippokratis Pandis and Ryan Johnson and Nikos
Hardavellas and Anastasia Ailamaki",
title = "Data-oriented transaction execution",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "928--939",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Deutch:2010:OTQ,
author = "Daniel Deutch and Tova Milo and Neoklis Polyzotis and
Tom Yam",
title = "Optimal top-$k$ query evaluation for weighted business
processes",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "940--951",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Wang:2010:BSM,
author = "Guozhang Wang and Marcos Vaz Salles and Benjamin
Sowell and Xun Wang and Tuan Cao and Alan Demers and
Johannes Gehrke and Walker White",
title = "Behavioral simulations in {MapReduce}",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "952--963",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Ge:2010:TSS,
author = "Tingjian Ge and Stan Zdonik",
title = "{A*-tree}: a structure for storage and modeling of
uncertain multidimensional arrays",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "964--974",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Aggarwal:2010:DPM,
author = "Charu C. Aggarwal and Yao Li and Philip S. Yu and
Ruoming Jin",
title = "On dense pattern mining in graph streams",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "975--984",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Yiu:2010:EPD,
author = "Man Lung Yiu and Leong Hou U. and Simonas Saltenis and
Kostas Tzoumas",
title = "Efficient proximity detection among mobile users via
self-tuning policies",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "985--996",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Potamias:2010:KNN,
author = "Michalis Potamias and Francesco Bonchi and Aristides
Gionis and George Kollios",
title = "k-nearest neighbors in uncertain graphs",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "997--1008",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Cao:2010:MSS,
author = "Xin Cao and Gao Cong and Christian S. Jensen",
title = "Mining significant semantic locations from {GPS}
data",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1009--1020",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Hay:2010:BAD,
author = "Michael Hay and Vibhor Rastogi and Gerome Miklau and
Dan Suciu",
title = "Boosting the accuracy of differentially private
histograms through consistency",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1021--1032",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Cao:2010:UIP,
author = "Jianneng Cao and Panagiotis Karras and Chedy
Ra{\"\i}ssi and Kian-Lee Tan",
title = "$ \rho $-uncertainty: inference-proof transaction
anonymization",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1033--1044",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Cormode:2010:MMM,
author = "Graham Cormode and Divesh Srivastava and Ninghui Li
and Tiancheng Li",
title = "Minimizing minimality and maximizing utility:
analyzing method-based attacks on anonymized data",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1045--1056",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Wang:2010:QPI,
author = "Daisy Zhe Wang and Michael J. Franklin and Minos
Garofalakis and Joseph M. Hellerstein",
title = "Querying probabilistic information extraction",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1057--1067",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Sen:2010:ROF,
author = "Prithviraj Sen and Amol Deshpande and Lise Getoor",
title = "Read-once functions and query evaluation in
probabilistic databases",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1068--1079",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Agrawal:2010:FUD,
author = "Parag Agrawal and Anish Das Sarma and Jeffrey Ullman
and Jennifer Widom",
title = "Foundations of uncertain-data integration",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1080--1090",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Mathioudakis:2010:IAD,
author = "Michael Mathioudakis and Nilesh Bansal and Nick
Koudas",
title = "Identifying, attributing and describing spatial
bursts",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1091--1102",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Kimura:2010:CCA,
author = "Hideaki Kimura and George Huo and Alexander Rasin and
Samuel Madden and Stanley B. Zdonik",
title = "{CORADD}: correlation aware database designer for
materialized views and indexes",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1103--1113",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Nanongkai:2010:RMR,
author = "Danupon Nanongkai and Atish Das Sarma and Ashwin Lall
and Richard J. Lipton and Jun Xu",
title = "Regret-minimizing representative databases",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1114--1124",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Arai:2010:ACA,
author = "Benjamin Arai and Gautam Das and Dimitrios Gunopulos
and Vagelis Hristidis and Nick Koudas",
title = "An access cost-aware approach for object retrieval
over multiple sources",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1125--1136",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Abhirama:2010:SPC,
author = "M. Abhirama and Sourjya Bhaumik and Atreyee Dey and
Harsh Shrimal and Jayant R. Haritsa",
title = "On the stability of plan costs and the costs of plan
stability",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1137--1148",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Herodotou:2010:XST,
author = "Herodotos Herodotou and Shivnath Babu",
title = "{Xplus}: a {SQL}-tuning-aware query optimizer",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1149--1160",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Fan:2010:GHR,
author = "Wenfei Fan and Jianzhong Li and Shuai Ma and Hongzhi
Wang and Yinghui Wu",
title = "Graph homomorphism revisited for graph matching",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1161--1172",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Kandhan:2010:SFS,
author = "Ramakrishnan Kandhan and Nikhil Teletia and Jignesh M.
Patel",
title = "{SigMatch}: fast and scalable multi-pattern matching",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1173--1184",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Zhang:2010:SSI,
author = "Shijie Zhang and Jiong Yang and Wei Jin",
title = "{SAPPER}: subgraph indexing and approximate matching
in large graphs",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1185--1194",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Li:2010:TIS,
author = "Yinan Li and Bingsheng He and Robin Jun Yang and Qiong
Luo and Ke Yi",
title = "Tree indexing on solid state drives",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1195--1206",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Wu:2010:EBT,
author = "Sai Wu and Dawei Jiang and Beng Chin Ooi and Kun-Lung
Wu",
title = "Efficient {B-tree} based indexing for cloud data
processing",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1207--1218",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Wang:2010:TJE,
author = "Jiannan Wang and Jianhua Feng and Guoliang Li",
title = "{Trie-join}: efficient trie-based string similarity
joins with edit-distance constraints",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1219--1230",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Sharifzadeh:2010:VTR,
author = "Mehdi Sharifzadeh and Cyrus Shahabi",
title = "{VoR-tree}: {R-trees} with {Voronoi} diagrams for
efficient processing of spatial nearest neighbor
queries",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1231--1242",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Deepak:2010:ERR,
author = "P. Deepak and Prasad M. Deshpande",
title = "Efficient {RkNN} retrieval with arbitrary non-metric
similarity measures",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1243--1254",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Zhang:2010:ESE,
author = "Shiming Zhang and Nikos Mamoulis and David W. Cheung
and Ben Kao",
title = "Efficient skyline evaluation over partially ordered
domains",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1255--1266",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Wei:2010:AHO,
author = "Mingzhu Wei and Elke A. Rundensteiner and Murali
Mani",
title = "Achieving high output quality under limited resources
through structure-based spilling in {XML} streams",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1267--1278",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Mihaylov:2010:DJO,
author = "Svilen R. Mihaylov and Marie Jacob and Zachary G. Ives
and Sudipto Guha",
title = "Dynamic join optimization in multi-hop wireless sensor
networks",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1279--1290",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Akdere:2010:DSC,
author = "Mert Akdere and U{\u{g}}ur {\c{C}}etintemel and Eli
Upfal",
title = "Database-support for continuous prediction queries
over streaming data",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1291--1301",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Tran:2010:CAU,
author = "Thanh T. L. Tran and Andrew McGregor and Yanlei Diao
and Liping Peng and Anna Liu",
title = "Conditioning and aggregating uncertain data streams:
going beyond expectations",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1302--1313",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Glavic:2010:TUB,
author = "Boris Glavic and Gustavo Alonso and Ren{\'e}e J.
Miller and Laura M. Haas",
title = "{TRAMP}: understanding the behavior of schema mappings
through provenance",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1314--1325",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Whang:2010:ERE,
author = "Steven Euijong Whang and Hector Garcia-Molina",
title = "Entity resolution with evolving rules",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1326--1337",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Limaye:2010:ASW,
author = "Girija Limaye and Sunita Sarawagi and Soumen
Chakrabarti",
title = "Annotating and searching {Web} tables using entities,
types and relationships",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1338--1347",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Bedathur:2010:IPM,
author = "Srikanta Bedathur and Klaus Berberich and Jens
Dittrich and Nikos Mamoulis and Gerhard Weikum",
title = "Interesting-phrase mining for ad-hoc text analytics",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1348--1357",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Dong:2010:GDC,
author = "Xin Luna Dong and Laure Berti-Equille and Yifan Hu and
Divesh Srivastava",
title = "Global detection of complex copying relationships
between sources",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1358--1369",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{DeCapitanidiVimercati:2010:FLA,
author = "Sabrina {De Capitani di Vimercati} and Sara Foresti
and Sushil Jajodia and Stefano Paraboschi and
Pierangela Samarati",
title = "Fragments and loose associations: respecting privacy
in data publishing",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1370--1381",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Fusco:2010:NFF,
author = "Francesco Fusco and Marc Ph. Stoecklin and Michail
Vlachos",
title = "{NET-FLi}: on-the-fly compression, archiving and
indexing of streaming network traffic",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1382--1393",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Zou:2010:SRQ,
author = "Qiong Zou and Huayong Wang and Robert Soul{\'e} and
Martin Hirzel and Henrique Andrade and Bu{\u{g}}ra
Gedik and Kun-Lung Wu",
title = "From a stream of relational queries to distributed
stream processing",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1394--1405",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Mah:2010:UUA,
author = "James T. L. Mah and Danny C. C. Poo and Shaojiang
Cai",
title = "{UASMAs} (universal automated {SNP} mapping
algorithms): a set of algorithms to instantaneously map
{SNPs} in real time to aid functional {SNP} discovery",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1406--1413",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Debnath:2010:FHT,
author = "Biplob Debnath and Sudipta Sengupta and Jin Li",
title = "{FlashStore}: high throughput persistent key--value
store",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1414--1425",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Xin:2010:MDA,
author = "Reynold S. Xin and William McLaren and Patrick
Dantressangle and Steve Schormann and Sam Lightstone
and Maria Schwenger",
title = "{MEET DB2}: automated database migration evaluation",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1426--1434",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Canim:2010:SBE,
author = "Mustafa Canim and George A. Mihaila and Bishwaranjan
Bhattacharjee and Kenneth A. Ross and Christian A.
Lang",
title = "{SSD} bufferpool extensions for database systems",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1435--1446",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Loboz:2010:DWM,
author = "Charles Loboz and Slawek Smyl and Suman Nath",
title = "{DataGarage}: warehousing massive performance data on
commodity servers",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1447--1458",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Chen:2010:CHP,
author = "Songting Chen",
title = "{Cheetah}: a high performance, custom data warehouse
on top of {MapReduce}",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1459--1468",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Orair:2010:DBO,
author = "Gustavo H. Orair and Carlos H. C. Teixeira Wagner
{Meira, Jr.} and Ye Wang and Srinivasan Parthasarathy",
title = "Distance-based outlier detection: consolidation and
renewed bearing",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1469--1480",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Kim:2010:ALM,
author = "Young-Seok Kim and Heegyu Jin and Kyoung-Gu Woo",
title = "Adaptive logging for mobile device",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1481--1492",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Pesti:2010:RSL,
author = "Peter Pesti and Ling Liu and Bhuvan Bamba and Arun
Iyengar and Matt Weber",
title = "{RoadTrack}: scaling location updates for mobile
clients on road networks with query awareness",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1493--1504",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Si:2010:CID,
author = "Xiance Si and Edward Y. Chang and Zolt{\'a}n
Gy{\"o}ngyi and Maosong Sun",
title = "{Confucius} and its intelligent disciples: integrating
social with search",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1505--1516",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Haritsa:2010:PDQ,
author = "Jayant R. Haritsa",
title = "The {Picasso} database query optimizer visualizer",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1517--1520",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Liu:2010:CED,
author = "Ziyang Liu and Sivaramakrishnan Natarajan and Bin He
and Hui-I Hsiao and Yi Chen",
title = "{CODS}: evolving data efficiently and scalably in
column oriented databases",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1521--1524",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Sadoghi:2010:EEP,
author = "Mohammad Sadoghi and Martin Labrecque and Harsh Singh
and Warren Shum and Hans-Arno Jacobsen",
title = "Efficient event processing through reconfigurable
hardware for algorithmic trading",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1525--1528",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Levandoski:2010:CCP,
author = "Justin J. Levandoski and Mohamed F. Mokbel and Mohamed
E. Khalefa",
title = "{CareDB}: a context and preference-aware
location-based database system",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1529--1532",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Kossmann:2010:CMC,
author = "Donald Kossmann and Tim Kraska and Simon Loesing and
Stephan Merkli and Raman Mittal and Flavio
Pfaffhauser",
title = "{Cloudy}: a modular cloud storage system",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1533--1536",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Kazemitabar:2010:GSQ,
author = "Seyed Jalal Kazemitabar and Ugur Demiryurek and
Mohamed Ali and Afsin Akdogan and Cyrus Shahabi",
title = "Geospatial stream query processing using {Microsoft
SQL Server StreamInsight}",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1537--1540",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Dyreson:2010:UXT,
author = "Curtis E. Dyreson and Sourav S. Bhowmick and
Kirankanth Mallampalli",
title = "Using {XMorph} to transform {XML} data",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1541--1544",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Wang:2010:ACE,
author = "Di Wang and Elke A. Rundensteiner and Han Wang and
Richard T. {Ellison III}",
title = "Active complex event processing: applications in
real-time health care",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1545--1548",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Schreiber:2010:TNP,
author = "Tom Schreiber and Simone Bonetti and Torsten Grust and
Manuel Mayr and Jan Rittinger",
title = "Thirteen new players in the team: a {FERRY}-based
{LINQ} to {SQL} provider",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1549--1552",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Abiteboul:2010:AEC,
author = "Serge Abiteboul and Pierre Bourhis and Bogdan Marinoiu
and Alban Galland",
title = "{AXART}: enabling collaborative work with {AXML}
artifacts",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1553--1556",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{McConnell:2010:IAF,
author = "Christopher McConnell and Fan Ping and Jeong-Hyon
Hwang",
title = "{iFlow}: an approach for fast and reliable
{Internet-scale} stream processing utilizing detouring
and replication",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1557--1560",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Kantere:2010:PCT,
author = "Verena Kantere and Maher Manoubi and Iluju Kiringa and
Timos Sellis and John Mylopoulos",
title = "Peer coordination through distributed triggers",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1561--1564",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Wu:2010:SSY,
author = "Hao Wu and Guoliang Li and Chen Li and Lizhu Zhou",
title = "{Seaform}: search-as-you-type in forms",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1565--1568",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Strotgen:2010:TSE,
author = "Jannik Str{\"o}tgen and Michael Gertz",
title = "{TimeTrails}: a system for exploring spatio-temporal
information in documents",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1569--1572",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Pound:2010:QEF,
author = "Jeffrey Pound and Ihab F. Ilyas and Grant Weddell",
title = "{QUICK}: expressive and flexible search over knowledge
bases and text collections",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1573--1576",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Kwietniewski:2010:TXD,
author = "Marcin Kwietniewski and Jarek Gryz and Stephanie
Hazlewood and Paul {Van Run}",
title = "Transforming {XML} documents as schemas evolve",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1577--1580",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Liu:2010:XCT,
author = "Ziyang Liu and Sivaramakrishnan Natarajan and Peng Sun
and Stephen Booher and Tim Meehan and Robert Winkler
and Yi Chen",
title = "{XSACT}: a comparison tool for structured search
results",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1581--1584",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Abdessalem:2010:OLT,
author = "Talel Abdessalem and Bogdan Cautis and Nora
Derouiche",
title = "{ObjectRunner}: lightweight, targeted extraction and
querying of structured {Web} data",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1585--1588",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Elbassuoni:2010:RRW,
author = "Shady Elbassuoni and Katja Hose and Steffen Metzger
and Ralf Schenkel",
title = "{ROXXI}: {Reviving} witness {dOcuments} to {eXplore
eXtracted Information}",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1589--1592",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Termehchy:2010:EUD,
author = "Arash Termehchy and Marianne Winslett",
title = "{EXTRUCT}: using deep structural information in {XML}
keyword search",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1593--1596",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Akbarnejad:2010:SQR,
author = "Javad Akbarnejad and Gloria Chatzopoulou and Magdalini
Eirinaki and Suju Koshy and Sarika Mittal and Duc On
and Neoklis Polyzotis and Jothi S. Vindhiya Varman",
title = "{SQL QueRIE} recommendations",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1597--1600",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Ang:2010:PCM,
author = "Hock Hee Ang and Vivekanand Gopalkrishnan and Wee
Keong Ng and Steven C. H. Hoi",
title = "{P2PDocTagger}: content management through automated
{P2P} collaborative tagging",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1601--1604",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Setty:2010:IEI,
author = "Vinay Setty and Srikanta Bedathur and Klaus Berberich
and Gerhard Weikum",
title = "{InZeit}: efficiently identifying insightful time
points",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1605--1608",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Sun:2010:IIT,
author = "Aixin Sun and Sourav S. Bhowmick and Yao Liu",
title = "{iAVATAR}: an interactive tool for finding and
visualizing visual-representative tags in image
search",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1609--1612",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Kabisch:2010:DWI,
author = "Thomas Kabisch and Eduard C. Dragut and Clement Yu and
Ulf Leser",
title = "Deep {Web} integration with {VisQI}",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1613--1616",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Dong:2010:SST,
author = "Xin Luna Dong and Laure Berti-Equille and Yifan Hu and
Divesh Srivastava",
title = "{SOLOMON}: seeking the truth via copying detection",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1617--1620",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Hentschel:2010:JTD,
author = "Martin Hentschel and Laura Haas and Ren{\'e}e J.
Miller",
title = "Just-in-time data integration in action",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1621--1624",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Alexandrov:2010:MPD,
author = "Alexander Alexandrov and Max Heimel and Volker Markl
and Dominic Battr{\'e} and Fabian Hueske and Erik
Nijkamp and Stephan Ewen and Odej Kao and Daniel
Warneke",
title = "Massively parallel data analysis with {PACTs} on
{Nephele}",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1625--1628",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Middelfart:2010:UST,
author = "Morten Middelfart and Torben Bach Pedersen",
title = "Using sentinel technology in the {TARGIT BI} suite",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1629--1632",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Gunnemann:2010:CIC,
author = "Stephan G{\"u}nnemann and Ines F{\"a}rber and Hardy
Kremer and Thomas Seidl",
title = "{CoDA}: interactive cluster based concept discovery",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1633--1636",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Bergamaschi:2010:KSK,
author = "Sonia Bergamaschi and Elton Domnori and Francesco
Guerra and Mirko Orsini and Raquel Trillo Lado and
Yannis Velegrakis",
title = "{Keymantic}: semantic keyword-based searching in data
integration systems",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1637--1640",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Golab:2010:DAE,
author = "Lukasz Golab and Howard Karloff and Flip Korn and
Divesh Srivastava",
title = "Data {Auditor}: exploring data quality and semantics
using pattern tableaux",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1641--1644",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Nori:2010:DCP,
author = "Anil K. Nori",
title = "Distributed caching platforms",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1645--1646",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Agrawal:2010:BDC,
author = "Divyakant Agrawal and Sudipto Das and Amr {El
Abbadi}",
title = "Big data and cloud computing: new wine or just new
bottles?",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1647--1648",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Samet:2010:TSS,
author = "Hanan Samet",
title = "Techniques for similarity searching in multimedia
databases",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1649--1650",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Etzion:2010:EPP,
author = "Opher Etzion",
title = "Event processing: past, present and future",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1651--1652",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Renz:2010:SSM,
author = "Matthias Renz and Reynold Cheng and Hans-Peter
Kriegel",
title = "Similarity search and mining in uncertain databases",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1653--1654",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Muthukrishnan:2010:DMM,
author = "S. Muthukrishnan",
title = "Data management and mining in {Internet AD} systems",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "3",
number = "1--2",
pages = "1655--1656",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:02 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Kling:2010:GEE,
author = "Patrick Kling and M. Tamer {\"O}zsu and Khuzaima
Daudjee",
title = "Generating efficient execution plans for vertically
partitioned {XML} databases",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "4",
number = "1",
pages = "1--11",
month = oct,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:15 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Lian:2010:GFH,
author = "Xiang Lian and Lei Chen",
title = "A generic framework for handling uncertain data with
local correlations",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "4",
number = "1",
pages = "12--21",
month = oct,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:15 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Khoussainova:2010:SCA,
author = "Nodira Khoussainova and YongChul Kwon and Magdalena
Balazinska and Dan Suciu",
title = "{SnipSuggest}: context-aware autocompletion for
{SQL}",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "4",
number = "1",
pages = "22--33",
month = oct,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:15 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Meliou:2010:CCR,
author = "Alexandra Meliou and Wolfgang Gatterbauer and
Katherine F. Moore and Dan Suciu",
title = "The complexity of causality and responsibility for
query answers and non-answers",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "4",
number = "1",
pages = "34--45",
month = oct,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:15 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Sagy:2010:DTQ,
author = "Guy Sagy and Daniel Keren and Izchak Sharfman and
Assaf Schuster",
title = "Distributed threshold querying of general functions by
a difference of monotonic representation",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "4",
number = "2",
pages = "46--57",
month = nov,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:15 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Wang:2010:TBD,
author = "Nan Wang and Jingbo Zhang and Kian-Lee Tan and Anthony
K. H. Tung",
title = "On triangulation-based dense neighborhood graph
discovery",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "4",
number = "2",
pages = "58--68",
month = nov,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:15 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Rice:2010:GIR,
author = "Michael Rice and Vassilis J. Tsotras",
title = "Graph indexing of road networks for shortest path
queries with label restrictions",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "4",
number = "2",
pages = "69--80",
month = nov,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:15 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Qian:2010:CUF,
author = "Li Qian and Kristen LeFevre and H. V. Jagadish",
title = "{CRIUS}: user-friendly database design",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "4",
number = "2",
pages = "81--92",
month = nov,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:15 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Rocha-Junior:2010:EPT,
author = "Jo{\~a}o B. Rocha-Junior and Akrivi Vlachou and
Christos Doulkeridis and Kjetil N{\o}rv{\aa}g",
title = "Efficient processing of top-$k$ spatial preference
queries",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "4",
number = "2",
pages = "93--104",
month = nov,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:15 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Grund:2010:HMM,
author = "Martin Grund and Jens Kr{\"u}ger and Hasso Plattner
and Alexander Zeier and Philippe Cudre-Mauroux and
Samuel Madden",
title = "{HYRISE}: a main memory hybrid storage engine",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "4",
number = "2",
pages = "105--116",
month = nov,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:15 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Curino:2010:URI,
author = "Carlo A. Curino and Hyun Jin Moon and Alin Deutsch and
Carlo Zaniolo",
title = "Update rewriting and integrity constraint maintenance
in a schema evolution support system: {PRISM++}",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "4",
number = "2",
pages = "117--128",
month = nov,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:15 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Oro:2010:SEX,
author = "Ermelinda Oro and Massimo Ruffolo and Steffen Staab",
title = "{SXPath}: extending {XPath} towards spatial querying
on {Web} documents",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "4",
number = "2",
pages = "129--140",
month = nov,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:15 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Yuan:2010:PPP,
author = "Mingxuan Yuan and Lei Chen and Philip S. Yu",
title = "Personalized privacy protection in social networks",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "4",
number = "2",
pages = "141--150",
month = nov,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:15 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Toda:2010:PAA,
author = "Guilherme A. Toda and Eli Cortez and Altigran S. da
Silva and Edleno de Moura",
title = "A probabilistic approach for automatically filling
form-based {Web} interfaces",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "4",
number = "3",
pages = "151--160",
month = dec,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:16 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Papadimitriou:2010:OUB,
author = "Panagiotis Papadimitriou and Hector Garcia-Molina and
Ali Dasdan and Santanu Kolay",
title = "Output {URL} bidding",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "4",
number = "3",
pages = "161--172",
month = dec,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:16 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Bahmani:2010:FIP,
author = "Bahman Bahmani and Abdur Chowdhury and Ashish Goel",
title = "Fast incremental and personalized {PageRank}",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "4",
number = "3",
pages = "173--184",
month = dec,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:16 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "In this paper, we analyze the efficiency of Monte
Carlo methods for incremental computation of PageRank,
personalized PageRank, and similar random walk based
methods (with focus on SALSA), on large-scale
dynamically evolving social networks. We assume that
the graph of friendships is stored in distributed
shared memory, as is the case for large social networks
such as Twitter.\par
For global PageRank, we assume that the social network
has $n$ nodes, and $m$ adversarially chosen edges
arrive in a random order. We show that with a reset
probability of $ \epsilon $, the expected total work
needed to maintain an accurate estimate (using the
Monte Carlo method) of the PageRank of every node at
all times is $ O(n \ln m / \epsilon^2)$. This is
significantly better than all known bounds for
incremental PageRank. For instance, if we naively
recompute the PageRanks as each edge arrives, the
simple power iteration method needs $ \Omega (m^2 / \ln
(1 / (1 - \epsilon)))$ total time and the Monte Carlo
method needs $ O(m n / \epsilon)$ total time; both are
prohibitively expensive. We also show that we can
handle deletions equally efficiently.\par
We then study the computation of the top $k$
personalized PageRanks starting from a seed node,
assuming that personalized PageRanks follow a power-law
with exponent $ < 1$. We show that if we store $ R > q
\ln n$ random walks starting from every node for large
enough constant $q$ (using the approach outlined for
global PageRank), then the expected number of calls
made to the distributed social network database is $
O(k / (R^{(1 - \alpha) / \alpha }))$. We also present
experimental results from the social networking site,
Twitter, verifying our assumptions and analyses. The
overall result is that this algorithm is fast enough
for real-time queries over a dynamic social network.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Lee:2010:QES,
author = "Jongwuk Lee and Seung-won Hwang",
title = "{QSkycube}: efficient skycube computation using
point-based space partitioning",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "4",
number = "3",
pages = "185--196",
month = dec,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:16 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Liu:2010:ZEI,
author = "Bin Liu and Chee-Yong Chan",
title = "{ZINC}: efficient indexing for skyline computation",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "4",
number = "3",
pages = "197--207",
month = dec,
year = "2010",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:16 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Rastogi:2011:LSC,
author = "Vibhor Rastogi and Nilesh Dalvi and Minos
Garofalakis",
title = "Large-scale collective entity matching",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "4",
number = "4",
pages = "208--218",
month = jan,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:17 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Dalvi:2011:AWL,
author = "Nilesh Dalvi and Ravi Kumar and Mohamed Soliman",
title = "Automatic wrappers for large scale {Web} extraction",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "4",
number = "4",
pages = "219--230",
month = jan,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:17 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Yang:2011:FSM,
author = "Xintian Yang and Srinivasan Parthasarathy and P.
Sadayappan",
title = "Fast sparse matrix-vector multiplication on {GPUs}:
implications for graph mining",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "4",
number = "4",
pages = "231--242",
month = jan,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:17 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Rao:2011:UPB,
author = "Jun Rao and Eugene J. Shekita and Sandeep Tata",
title = "Using {Paxos} to build a scalable, consistent, and
highly available datastore",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "4",
number = "4",
pages = "243--254",
month = jan,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:17 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Ding:2011:FSI,
author = "Bolin Ding and Arnd Christian K{\"o}nig",
title = "Fast set intersection in memory",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "4",
number = "4",
pages = "255--266",
month = jan,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:17 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Parameswaran:2011:HAG,
author = "Aditya Parameswaran and Anish Das Sarma and Hector
Garcia-Molina and Neoklis Polyzotis and Jennifer
Widom",
title = "Human-assisted graph search: it's okay to ask
questions",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "4",
number = "5",
pages = "267--278",
month = feb,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:18 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Yakout:2011:GDR,
author = "Mohamed Yakout and Ahmed K. Elmagarmid and Jennifer
Neville and Mourad Ouzzani and Ihab F. Ilyas",
title = "Guided data repair",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "4",
number = "5",
pages = "279--289",
month = feb,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:18 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Venetis:2011:HLD,
author = "Petros Venetis and Hector Gonzalez and Christian S.
Jensen and Alon Halevy",
title = "Hyper-local, directions-based ranking of places",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "4",
number = "5",
pages = "290--301",
month = feb,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:18 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Koc:2011:IMC,
author = "M. Levent Koc and Christopher R{\'e}",
title = "Incrementally maintaining classification using an
{RDBMS}",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "4",
number = "5",
pages = "302--313",
month = feb,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:18 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{He:2011:HTT,
author = "Bingsheng He and Jeffrey Xu Yu",
title = "High-throughput transaction executions on graphics
processors",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "4",
number = "5",
pages = "314--325",
month = feb,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:18 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Cao:2011:DIQ,
author = "Zhao Cao and Charles Sutton and Yanlei Diao and
Prashant Shenoy",
title = "Distributed inference and query processing for {RFID}
tracking and monitoring",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "4",
number = "5",
pages = "326--337",
month = feb,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:55:18 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Lee:2011:SJS,
author = "Hongrae Lee and Raymond T. Ng and Kyuseok Shim",
title = "Similarity join size estimation using locality
sensitive hashing",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "4",
number = "6",
pages = "338--349",
month = mar,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:45:07 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Liu:2011:QEB,
author = "Ziyang Liu and Sivaramakrishnan Natarajan and Yi
Chen",
title = "Query expansion based on clustered results",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "4",
number = "6",
pages = "350--361",
month = mar,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:45:07 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Dash:2011:CSP,
author = "Debabrata Dash and Neoklis Polyzotis and Anastasia
Ailamaki",
title = "{CoPhy}: a scalable, portable, and interactive index
advisor for large workloads",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "4",
number = "6",
pages = "362--372",
month = mar,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:45:07 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Niu:2011:TSS,
author = "Feng Niu and Christopher R{\'e} and AnHai Doan and
Jude Shavlik",
title = "{Tuffy}: scaling up statistical inference in {Markov}
logic networks using an {RDBMS}",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "4",
number = "6",
pages = "373--384",
month = mar,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:45:07 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Jahani:2011:AOM,
author = "Eaman Jahani and Michael J. Cafarella and Christopher
R{\'e}",
title = "Automatic optimization for {MapReduce} programs",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "4",
number = "6",
pages = "385--396",
month = mar,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:45:07 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Yang:2011:STG,
author = "De-Nian Yang and Yi-Ling Chen and Wang-Chien Lee and
Ming-Syan Chen",
title = "On social-temporal group query with acquaintance
constraint",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "4",
number = "6",
pages = "397--408",
month = mar,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Fri May 13 14:45:07 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Nguyen:2011:SPO,
author = "Hoa Nguyen and Ariel Fuxman and Stelios Paparizos and
Juliana Freire and Rakesh Agrawal",
title = "Synthesizing products for online catalogs",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "4",
number = "7",
pages = "409--418",
month = apr,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Tue Jun 7 19:31:12 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Floratou:2011:COS,
author = "Avrilia Floratou and Jignesh M. Patel and Eugene J.
Shekita and Sandeep Tata",
title = "Column-oriented storage techniques for {MapReduce}",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "4",
number = "7",
pages = "419--429",
month = apr,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Tue Jun 7 19:31:12 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Lomet:2011:IPC,
author = "David Lomet and Kostas Tzoumas and Michael Zwilling",
title = "Implementing performance competitive logical
recovery",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "4",
number = "7",
pages = "430--439",
month = apr,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Tue Jun 7 19:31:12 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Machanavajjhala:2011:PSR,
author = "Ashwin Machanavajjhala and Aleksandra Korolova and
Atish Das Sarma",
title = "Personalized social recommendations: accurate or
private",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "4",
number = "7",
pages = "440--450",
month = apr,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Tue Jun 7 19:31:12 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Capannini:2011:EDW,
author = "Gabriele Capannini and Franco Maria Nardini and
Raffaele Perego and Fabrizio Silvestri",
title = "Efficient diversification of {Web} search results",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "4",
number = "7",
pages = "451--459",
month = apr,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Tue Jun 7 19:31:12 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{DeFrancisciMorales:2011:SCM,
author = "Gianmarco {De Francisci Morales} and Aristides Gionis
and Mauro Sozio",
title = "Social content matching in {MapReduce}",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "4",
number = "7",
pages = "460--469",
month = apr,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Tue Jun 7 19:31:12 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Ao:2011:EPL,
author = "Naiyong Ao and Fan Zhang and Di Wu and Douglas S.
Stones and Gang Wang and Xiaoguang Liu and Jing Liu and
Sheng Lin",
title = "Efficient parallel lists intersection and index
compression algorithms using graphics processing
units",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "4",
number = "8",
pages = "470--481",
month = may,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Mon Sep 5 17:23:33 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Zou:2011:GAS,
author = "Lei Zou and Jinghui Mo and Lei Chen and M. Tamer
{\"O}zsu and Dongyan Zhao",
title = "{gStore}: answering {SPARQL} queries via subgraph
matching",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "4",
number = "8",
pages = "482--493",
month = may,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Mon Sep 5 17:23:33 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Das:2011:ALE,
author = "Sudipto Das and Shoji Nishimura and Divyakant Agrawal
and Amr {El Abbadi}",
title = "{Albatross}: lightweight elasticity in shared storage
databases for the cloud using live data migration",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "4",
number = "8",
pages = "494--505",
month = may,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Mon Sep 5 17:23:33 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Nutanong:2011:IHD,
author = "Sarana Nutanong and Edwin H. Jacox and Hanan Samet",
title = "An incremental {Hausdorff} distance calculation
algorithm",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "4",
number = "8",
pages = "506--517",
month = may,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Mon Sep 5 17:23:33 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Blaustein:2011:SPP,
author = "Barbara Blaustein and Adriane Chapman and Len Seligman
and M. David Allen and Arnon Rosenthal",
title = "Surrogate parenthood: protected and informative
graphs",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "4",
number = "8",
pages = "518--525",
month = may,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Mon Sep 5 17:23:33 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Venetis:2011:RST,
author = "Petros Venetis and Alon Halevy and Jayant Madhavan and
Marius Pasca and Warren Shen and Fei Wu and Gengxin
Miao and Chung Wu",
title = "Recovering semantics of tables on the web",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "4",
number = "9",
pages = "528--538",
month = jun,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Mon Sep 5 17:23:34 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Neumann:2011:ECE,
author = "Thomas Neumann",
title = "Efficiently compiling efficient query plans for modern
hardware",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "4",
number = "9",
pages = "539--550",
month = jun,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Mon Sep 5 17:23:34 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Jin:2011:DCR,
author = "Ruoming Jin and Lin Liu and Bolin Ding and Haixun
Wang",
title = "Distance-constraint reachability computation in
uncertain graphs",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "4",
number = "9",
pages = "551--562",
month = jun,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Mon Sep 5 17:23:34 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Chi:2011:IIC,
author = "Yun Chi and Hyun Jin Moon and Hakan
Hacig{\"u}m{\"u}s",
title = "{iCBS}: incremental cost-based scheduling under
piecewise linear {SLAs}",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "4",
number = "9",
pages = "563--574",
month = jun,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Mon Sep 5 17:23:34 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Eltabakh:2011:CFD,
author = "Mohamed Y. Eltabakh and Yuanyuan Tian and Fatma
{\"O}zcan and Rainer Gemulla and Aljoscha Krettek and
John McPherson",
title = "{CoHadoop}: flexible data placement and its
exploitation in {Hadoop}",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "4",
number = "9",
pages = "575--585",
month = jun,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Mon Sep 5 17:23:34 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Idreos:2011:MWC,
author = "Stratos Idreos and Stefan Manegold and Harumi Kuno and
Goetz Graefe",
title = "Merging what's cracked, cracking what's merged:
adaptive indexing in main-memory column-stores",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "4",
number = "9",
pages = "586--597",
month = jun,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Mon Sep 5 17:23:34 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Wang:2011:PTR,
author = "Chonghai Wang and Li Yan Yuan and Jia-Huai You and
Osmar R. Zaiane and Jian Pei",
title = "On pruning for top-$k$ ranking in uncertain
databases",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "4",
number = "10",
pages = "598--609",
month = jul,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Mon Sep 5 17:23:34 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Pandis:2011:PPL,
author = "Ippokratis Pandis and Pinar T{\"o}z{\"u}n and Ryan
Johnson and Anastasia Ailamaki",
title = "{PLP}: page latch-free shared-everything {OLTP}",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "4",
number = "10",
pages = "610--621",
month = jul,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Mon Sep 5 17:23:34 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Wang:2011:EMH,
author = "Jiannan Wang and Guoliang Li and Jeffrey Xu Yu and
Jianhua Feng",
title = "Entity matching: how similar is similar",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "4",
number = "10",
pages = "622--633",
month = jul,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Mon Sep 5 17:23:34 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Wang:2011:ACE,
author = "Di Wang and Elke A. Rundensteiner and Richard T.
{Ellison III}",
title = "Active complex event processing over event streams",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "4",
number = "10",
pages = "634--645",
month = jul,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Mon Sep 5 17:23:34 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Budak:2011:STA,
author = "Ceren Budak and Divyakant Agrawal and Amr {El
Abbadi}",
title = "Structural trend analysis for online social networks",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "4",
number = "10",
pages = "646--656",
month = jul,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Mon Sep 5 17:23:34 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Kimura:2011:CAP,
author = "Hideaki Kimura and Vivek Narasayya and Manoj Syamala",
title = "Compression aware physical database design",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "4",
number = "10",
pages = "657--668",
month = jul,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Mon Sep 5 17:23:34 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Bernecker:2011:EPR,
author = "Thomas Bernecker and Tobias Emrich and Hans-Peter
Kriegel and Matthias Renz and Stefan Zankl and Andreas
Z{\"u}fle",
title = "Efficient probabilistic reverse nearest neighbor query
processing on uncertain data",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "4",
number = "10",
pages = "669--680",
month = jul,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Mon Sep 5 17:23:34 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Kargar:2011:KSG,
author = "Mehdi Kargar and Aijun An",
title = "Keyword search in graphs: finding $r$-cliques",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "4",
number = "10",
pages = "681--692",
month = jul,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Mon Sep 5 17:23:34 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Fabbri:2011:EBA,
author = "Daniel Fabbri and Kristen LeFevre",
title = "Explanation-based auditing",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "1",
pages = "1--12",
month = sep,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Sat Mar 24 07:52:06 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "To comply with emerging privacy laws and regulations,
it has become common for applications like electronic
health records systems (EHRs) to collect access logs,
which record each time a user (e.g., a hospital
employee) accesses a piece of sensitive data (e.g., a
patient record). Using the access log, it is easy to
answer simple queries (e.g., Who accessed Alice's
medical record?), but this often does not provide
enough information. In addition to learning who
accessed their medical records, patients will likely
want to understand why each access occurred. In this
paper, we introduce the problem of generating
explanations for individual records in an access log.
The problem is motivated by user-centric auditing
applications, and it also provides a novel approach to
misuse detection. We develop a framework for modeling
explanations which is based on a fundamental
observation: For certain classes of databases,
including EHRs, the reason for most data accesses can
be inferred from data stored elsewhere in the database.
For example, if Alice has an appointment with Dr. Dave,
this information is stored in the database, and it
explains why Dr. Dave looked at Alice's record. Large
numbers of data accesses can be explained using general
forms called explanation templates. Rather than
requiring an administrator to manually specify
explanation templates, we propose a set of algorithms
for automatically discovering frequent templates from
the database (i.e., those that explain a large number
of accesses). We also propose techniques for inferring
collaborative user groups, which can be used to enhance
the quality of the discovered explanations. Finally, we
have evaluated our proposed techniques using an access
log and data from the University of Michigan Health
System. Our results demonstrate that in practice we can
provide explanations for over 94\% of data accesses in
the log.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Marcus:2011:HPS,
author = "Adam Marcus and Eugene Wu and David Karger and Samuel
Madden and Robert Miller",
title = "Human-powered sorts and joins",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "1",
pages = "13--24",
month = sep,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Sat Mar 24 07:52:06 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "Crowdsourcing markets like Amazon's Mechanical Turk
(MTurk) make it possible to task people with small
jobs, such as labeling images or looking up phone
numbers, via a programmatic interface. MTurk tasks for
processing datasets with humans are currently designed
with significant reimplementation of common workflows
and ad-hoc selection of parameters such as price to pay
per task. We describe how we have integrated crowds
into a declarative workflow engine called Qurk to
reduce the burden on workflow designers. In this paper,
we focus on how to use humans to compare items for
sorting and joining data, two of the most common
operations in DBMSs. We describe our basic query
interface and the user interface of the tasks we post
to MTurk. We also propose a number of optimizations,
including task batching, replacing pairwise comparisons
with numerical ratings, and pre-filtering tables before
joining them, which dramatically reduce the overall
cost of running sorts and joins on the crowd. In an
experiment joining two sets of images, we reduce the
overall cost from \$67 in a naive implementation to
about \$3, without substantially affecting accuracy or
latency. In an end-to-end experiment, we reduced cost
by a factor of 14.5.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Cormode:2011:VCS,
author = "Graham Cormode and Justin Thaler and Ke Yi",
title = "Verifying computations with streaming interactive
proofs",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "1",
pages = "25--36",
month = sep,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Sat Mar 24 07:52:06 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "When computation is outsourced, the data owner would
like to be assured that the desired computation has
been performed correctly by the service provider. In
theory, proof systems can give the necessary assurance,
but prior work is not sufficiently scalable or
practical. In this paper, we develop new proof
protocols for verifying computations which are
streaming in nature: the verifier (data owner) needs
only logarithmic space and a single pass over the
input, and after observing the input follows a simple
protocol with a prover (service provider) that takes
logarithmic communication spread over a logarithmic
number of rounds. These ensure that the computation is
performed correctly: that the service provider has not
made any errors or missed out some data. The guarantee
is very strong: even if the service provider
deliberately tries to cheat, there is only vanishingly
small probability of doing so undetected, while a
correct computation is always accepted. We first
observe that some theoretical results can be modified
to work with streaming verifiers, showing that there
are efficient protocols for problems in the complexity
classes NP and NC. Our main results then seek to bridge
the gap between theory and practice by developing
usable protocols for a variety of problems of central
importance in streaming and database processing. All
these problems require linear space in the traditional
streaming model, and therefore our protocols
demonstrate that adding a prover can exponentially
reduce the effort needed by the verifier. Our
experimental results show that our protocols are
practical and scalable.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Lin:2011:MOI,
author = "Dan Lin and Christian S. Jensen and Rui Zhang and Lu
Xiao and Jiaheng Lu",
title = "A moving-object index for efficient query processing
with peer-wise location privacy",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "1",
pages = "37--48",
month = sep,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Sat Mar 24 07:52:06 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "With the growing use of location-based services,
location privacy attracts increasing attention from
users, industry, and the research community. While
considerable effort has been devoted to inventing
techniques that prevent service providers from knowing
a user's exact location, relatively little attention
has been paid to enabling so-called peer-wise
privacy---the protection of a user's location from
unauthorized peer users. This paper identifies an
important efficiency problem in existing peer-privacy
approaches that simply apply a filtering step to
identify users that are located in a query range, but
that do not want to disclose their location to the
querying peer. To solve this problem, we propose a
novel, privacy-policy enabled index called the PEB-tree
that seamlessly integrates location proximity and
policy compatibility. We propose efficient algorithms
that use the PEB-tree for processing privacy-aware
range and $k$ NN queries. Extensive experiments suggest
that the PEB-tree enables efficient query processing.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Mansour:2011:EES,
author = "Essam Mansour and Amin Allam and Spiros Skiadopoulos
and Panos Kalnis",
title = "{ERA}: efficient serial and parallel suffix tree
construction for very long strings",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "1",
pages = "49--60",
month = sep,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Sat Mar 24 07:52:06 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "The suffix tree is a data structure for indexing
strings. It is used in a variety of applications such
as bioinformatics, time series analysis, clustering,
text editing and data compression. However, when the
string and the resulting suffix tree are too large to
fit into the main memory, most existing construction
algorithms become very inefficient. This paper presents
a disk-based suffix tree construction method, called
Elastic Range (ERa), which works efficiently with very
long strings that are much larger than the available
memory. ERa partitions the tree construction process
horizontally and vertically and minimizes I/Os by
dynamically adjusting the horizontal partitions
independently for each vertical partition, based on the
evolving shape of the tree and the available memory.
Where appropriate, ERa also groups vertical partitions
together to amortize the I/O cost. We developed a
serial version; a parallel version for shared-memory
and shared-disk multi-core systems; and a parallel
version for shared-nothing architectures. ERa indexes
the entire human genome in 19 minutes on an ordinary
desktop computer. For comparison, the fastest existing
method needs 15 minutes using 1024 CPUs on an IBM
BlueGene supercomputer.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Krueger:2011:FUR,
author = "Jens Krueger and Changkyu Kim and Martin Grund and
Nadathur Satish and David Schwalb and Jatin Chhugani
and Hasso Plattner and Pradeep Dubey and Alexander
Zeier",
title = "Fast updates on read-optimized databases using
multi-core {CPUs}",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "1",
pages = "61--72",
month = sep,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Sat Mar 24 07:52:06 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "Read-optimized columnar databases use differential
updates to handle writes by maintaining a separate
write-optimized delta partition which is periodically
merged with the read-optimized and compressed main
partition. This merge process introduces significant
overheads and unacceptable downtimes in update
intensive systems, aspiring to combine transactional
and analytical workloads into one system. In the first
part of the paper, we report data analyses of 12 SAP
Business Suite customer systems. In the second half, we
present an optimized merge process reducing the merge
overhead of current systems by a factor of 30. Our
linear-time merge algorithm exploits the underlying
high compute and bandwidth resources of modern
multi-core CPUs with architecture-aware optimizations
and efficient parallelization. This enables compressed
in-memory column stores to handle the transactional
update rate required by enterprise applications, while
keeping properties of read-optimized databases for
analytic-style queries.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Goyal:2011:DBA,
author = "Amit Goyal and Francesco Bonchi and Laks V. S.
Lakshmanan",
title = "A data-based approach to social influence
maximization",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "1",
pages = "73--84",
month = sep,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Sat Mar 24 07:52:06 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "Influence maximization is the problem of finding a set
of users in a social network, such that by targeting
this set, one maximizes the expected spread of
influence in the network. Most of the literature on
this topic has focused exclusively on the social graph,
overlooking historical data, i.e., traces of past
action propagations. In this paper, we study influence
maximization from a novel data-based perspective. In
particular, we introduce a new model, which we call
credit distribution, that directly leverages available
propagation traces to learn how influence flows in the
network and uses this to estimate expected influence
spread. Our approach also learns the different levels
of influence-ability of users, and it is time-aware in
the sense that it takes the temporal nature of
influence into account. We show that influence
maximization under the credit distribution model is NP
-hard and that the function that defines expected
spread under our model is submodular. Based on these,
we develop an approximation algorithm for solving the
influence maximization problem that at once enjoys high
accuracy compared to the standard approach, while being
several orders of magnitude faster and more scalable.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Pavlo:2011:PMO,
author = "Andrew Pavlo and Evan P. C. Jones and Stanley Zdonik",
title = "On predictive modeling for optimizing transaction
execution in parallel {OLTP} systems",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "2",
pages = "85--96",
month = oct,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Sat Mar 24 07:52:08 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "A new emerging class of parallel database management
systems (DBMS) is designed to take advantage of the
partitionable workloads of on-line transaction
processing (OLTP) applications [23, 20]. Transactions
in these systems are optimized to execute to completion
on a single node in a shared-nothing cluster without
needing to coordinate with other nodes or use expensive
concurrency control measures [18]. But some OLTP
applications cannot be partitioned such that all of
their transactions execute within a single-partition in
this manner. These distributed transactions access data
not stored within their local partitions and
subsequently require more heavy-weight concurrency
control protocols. Further difficulties arise when the
transaction's execution properties, such as the number
of partitions it may need to access or whether it will
abort, are not known beforehand. The DBMS could
mitigate these performance issues if it is provided
with additional information about transactions. Thus,
in this paper we present a Markov model-based approach
for automatically selecting which optimizations a DBMS
could use, namely (1) more efficient concurrency
control schemes, (2) intelligent scheduling, (3)
reduced undo logging, and (4) speculative execution. To
evaluate our techniques, we implemented our models and
integrated them into a parallel, main-memory OLTP DBMS
to show that we can improve the performance of
applications with diverse workloads.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Goasdoue:2011:VSS,
author = "Fran{\c{c}}ois Goasdou{\'e} and Konstantinos Karanasos
and Julien Leblay and Ioana Manolescu",
title = "View selection in {Semantic Web} databases",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "2",
pages = "97--108",
month = oct,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Sat Mar 24 07:52:08 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "We consider the setting of a Semantic Web database,
containing both explicit data encoded in RDF triples,
and implicit data, implied by the RDF semantics. Based
on a query workload, we address the problem of
selecting a set of views to be materialized in the
database, minimizing a combination of query processing,
view storage, and view maintenance costs. Starting from
an existing relational view selection method, we devise
new algorithms for recommending view sets, and show
that they scale significantly beyond the existing
relational ones when adapted to the RDF context. To
account for implicit triples in query answers, we
propose a novel RDF query reformulation algorithm and
an innovative way of incorporating it into view
selection in order to avoid a combinatorial explosion
in the complexity of the selection process. The
interest of our techniques is demonstrated through a
set of experiments.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Jestes:2011:BWH,
author = "Jeffrey Jestes and Ke Yi and Feifei Li",
title = "Building wavelet histograms on large data in
{MapReduce}",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "2",
pages = "109--120",
month = oct,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Sat Mar 24 07:52:08 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "MapReduce is becoming the de facto framework for
storing and processing massive data, due to its
excellent scalability, reliability, and elasticity. In
many MapReduce applications, obtaining a compact
accurate summary of data is essential. Among various
data summarization tools, histograms have proven to be
particularly important and useful for summarizing data,
and the wavelet histogram is one of the most widely
used histograms. In this paper, we investigate the
problem of building wavelet histograms efficiently on
large datasets in MapReduce. We measure the efficiency
of the algorithms by both end-to-end running time and
communication cost. We demonstrate straightforward
adaptations of existing exact and approximate methods
for building wavelet histograms to MapReduce clusters
are highly inefficient. To that end, we design new
algorithms for computing exact and approximate wavelet
histograms and discuss their implementation in
MapReduce. We illustrate our techniques in Hadoop, and
compare to baseline solutions with extensive
experiments performed in a heterogeneous Hadoop cluster
of 16 nodes, using large real and synthetic datasets,
up to hundreds of gigabytes. The results suggest
significant (often orders of magnitude) performance
improvement achieved by our new algorithms.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Yang:2011:SMD,
author = "Di Yang and Elke A. Rundensteiner and Matthew O.
Ward",
title = "Summarization and matching of density-based clusters
in streaming environments",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "2",
pages = "121--132",
month = oct,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Sat Mar 24 07:52:08 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "Density-based cluster mining is known to serve a broad
range of applications ranging from stock trade analysis
to moving object monitoring. Although methods for
efficient extraction of density-based clusters have
been studied in the literature, the problem of
summarizing and matching of such clusters with
arbitrary shapes and complex cluster structures remains
unsolved. Therefore, the goal of our work is to extend
the state-of-art of density-based cluster mining in
streams from cluster extraction only to now also
support analysis and management of the extracted
clusters. Our work solves three major technical
challenges. First, we propose a novel multi-resolution
cluster summarization method, called Skeletal Grid
Summarization (SGS), which captures the key features of
density-based clusters, covering both their external
shape and internal cluster structures. Second, in order
to summarize the extracted clusters in real-time, we
present an integrated computation strategy C-SGS, which
piggybacks the generation of cluster summarizations
within the online clustering process. Lastly, we design
a mechanism to efficiently execute cluster matching
queries, which identify similar clusters for given
cluster of analyst's interest from clusters extracted
earlier in the stream history. Our experimental study
using real streaming data shows the clear superiority
of our proposed methods in both efficiency and
effectiveness for cluster summarization and cluster
matching queries to other potential alternatives.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Nguyen:2011:MSM,
author = "Thanh Nguyen and Viviane Moreira and Huong Nguyen and
Hoa Nguyen and Juliana Freire",
title = "Multilingual schema matching for {Wikipedia}
infoboxes",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "2",
pages = "133--144",
month = oct,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Sat Mar 24 07:52:08 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "Recent research has taken advantage of Wikipedia's
multi-lingualism as a resource for cross-language
information retrieval and machine translation, as well
as proposed techniques for enriching its cross-language
structure. The availability of documents in multiple
languages also opens up new opportunities for querying
structured Wikipedia content, and in particular, to
enable answers that straddle different languages. As a
step towards supporting such queries, in this paper, we
propose a method for identifying mappings between
attributes from infoboxes that come from pages in
different languages. Our approach finds mappings in a
completely automated fashion. Because it does not
require training data, it is scalable: not only can it
be used to find mappings between many language pairs,
but it is also effective for languages that are
under-represented and lack sufficient training samples.
Another important benefit of our approach is that it
does not depend on syntactic similarity between
attribute names, and thus, it can be applied to
language pairs that have distinct morphologies. We have
performed an extensive experimental evaluation using a
corpus consisting of pages in Portuguese, Vietnamese,
and English. The results show that not only does our
approach obtain high precision and recall, but it also
outperforms state-of-the-art techniques. We also
present a case study which demonstrates that the
multilingual mappings we derive lead to substantial
improvements in answer quality and coverage for
structured queries over Wikipedia content.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Liu:2011:CFP,
author = "Guimei Liu and Haojun Zhang and Limsoon Wong",
title = "Controlling false positives in association rule
mining",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "2",
pages = "145--156",
month = oct,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Sat Mar 24 07:52:08 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "Association rule mining is an important problem in the
data mining area. It enumerates and tests a large
number of rules on a dataset and outputs rules that
satisfy user-specified constraints. Due to the large
number of rules being tested, rules that do not
represent real systematic effect in the data can
satisfy the given constraints purely by random chance.
Hence association rule mining often suffers from a high
risk of false positive errors. There is a lack of
comprehensive study on controlling false positives in
association rule mining. In this paper, we adopt three
multiple testing correction approaches---the direct
adjustment approach, the permutation-based approach and
the holdout approach---to control false positives in
association rule mining, and conduct extensive
experiments to study their performance. Our results
show that (1) Numerous spurious rules are generated if
no correction is made. (2) The three approaches can
control false positives effectively. Among the three
approaches, the permutation-based approach has the
highest power of detecting real association rules, but
it is very computationally expensive. We employ several
techniques to reduce its cost effectively.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Suchanek:2011:PPA,
author = "Fabian M. Suchanek and Serge Abiteboul and Pierre
Senellart",
title = "{PARIS}: probabilistic alignment of relations,
instances, and schema",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "3",
pages = "157--168",
month = nov,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Sat Mar 24 07:52:09 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "One of the main challenges that the Semantic Web faces
is the integration of a growing number of independently
designed ontologies. In this work, we present paris, an
approach for the automatic alignment of ontologies.
paris aligns not only instances, but also relations and
classes. Alignments at the instance level
cross-fertilize with alignments at the schema level.
Thereby, our system provides a truly holistic solution
to the problem of ontology alignment. The heart of the
approach is probabilistic, i.e., we measure degrees of
matchings based on probability estimates. This allows
paris to run without any parameter tuning. We
demonstrate the efficiency of the algorithm and its
precision through extensive experiments. In particular,
we obtain a precision of around 90\% in experiments
with some of the world's largest ontologies.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Ranu:2011:ATQ,
author = "Sayan Ranu and Ambuj K. Singh",
title = "Answering top-$k$ queries over a mixture of attractive
and repulsive dimensions",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "3",
pages = "169--180",
month = nov,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Sat Mar 24 07:52:09 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "In this paper, we formulate a top-$k$ query that
compares objects in a database to a user-provided query
object on a novel scoring function. The proposed
scoring function combines the idea of attractive and
repulsive dimensions into a general framework to
overcome the weakness of traditional distance or
similarity measures. We study the properties of the
proposed class of scoring functions and develop
efficient and scalable index structures that index the
isolines of the function. We demonstrate various
scenarios where the query finds application. Empirical
evaluation demonstrates a performance gain of one to
two orders of magnitude on querying time over existing
state-of-the-art top-$k$ techniques. Further, a
qualitative analysis is performed on a real dataset to
highlight the potential of the proposed query in
discovering hidden data characteristics.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Armbrust:2011:PST,
author = "Michael Armbrust and Kristal Curtis and Tim Kraska and
Armando Fox and Michael J. Franklin and David A.
Patterson",
title = "{PIQL}: success-tolerant query processing in the
cloud",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "3",
pages = "181--192",
month = nov,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Sat Mar 24 07:52:09 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "Newly-released web applications often succumb to a
``Success Disaster,'' where overloaded database
machines and resulting high response times destroy a
previously good user experience. Unfortunately, the
data independence provided by a traditional relational
database system, while useful for agile development,
only exacerbates the problem by hiding potentially
expensive queries under simple declarative expressions.
As a result, developers of these applications are
increasingly abandoning relational databases in favor
of imperative code written against distributed
key/value stores, losing the many benefits of data
independence in the process. Instead, we propose PIQL,
a declarative language that also provides scale
independence by calculating an upper bound on the
number of key/value store operations that will be
performed for any query. Coupled with a service level
objective (SLO) compliance prediction model and PIQL's
scalable database architecture, these bounds make it
easy for developers to write success-tolerant
applications that support an arbitrarily large number
of users while still providing acceptable performance.
In this paper, we present the PIQL query processing
system and evaluate its scale independence on hundreds
of machines using two benchmarks, TPC-W and SCADr.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Zhao:2011:GQE,
author = "Peixiang Zhao and Charu C. Aggarwal and Min Wang",
title = "{gSketch}: on query estimation in graph streams",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "3",
pages = "193--204",
month = nov,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Sat Mar 24 07:52:09 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "Many dynamic applications are built upon large network
infrastructures, such as social networks, communication
networks, biological networks and the Web. Such
applications create data that can be naturally modeled
as graph streams, in which edges of the underlying
graph are received and updated sequentially in a form
of a stream. It is often necessary and important to
summarize the behavior of graph streams in order to
enable effective query processing. However, the sheer
size and dynamic nature of graph streams present an
enormous challenge to existing graph management
techniques. In this paper, we propose a new graph
sketch method, gSketch, which combines well studied
synopses for traditional data streams with a sketch
partitioning technique, to estimate and optimize the
responses to basic queries on graph streams. We
consider two different scenarios for query estimation:
(1) A graph stream sample is available; (2) Both a
graph stream sample and a query workload sample are
available. Algorithms for different scenarios are
designed respectively by partitioning a global sketch
to a group of localized sketches in order to optimize
the query estimation accuracy. We perform extensive
experimental studies on both real and synthetic data
sets and demonstrate the power and robustness of
gSketch in comparison with the state-of-the-art global
sketch method.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Ruttenberg:2011:IEM,
author = "Brian E. Ruttenberg and Ambuj K. Singh",
title = "Indexing the earth mover's distance using normal
distributions",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "3",
pages = "205--216",
month = nov,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Sat Mar 24 07:52:09 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "Querying uncertain data sets (represented as
probability distributions) presents many challenges due
to the large amount of data involved and the
difficulties comparing uncertainty between
distributions. The Earth Mover's Distance (EMD) has
increasingly been employed to compare uncertain data
due to its ability to effectively capture the
differences between two distributions. Computing the
EMD entails finding a solution to the transportation
problem, which is computationally intensive. In this
paper, we propose a new lower bound to the EMD and an
index structure to significantly improve the
performance of EMD based K-- nearest neighbor (K--NN)
queries on uncertain databases. We propose a new lower
bound to the EMD that approximates the EMD on a
projection vector. Each distribution is projected onto
a vector and approximated by a normal distribution, as
well as an accompanying error term. We then represent
each normal as a point in a Hough transformed space. We
then use the concept of stochastic dominance to
implement an efficient index structure in the
transformed space. We show that our method
significantly decreases K--NN query time on uncertain
databases. The index structure also scales well with
database cardinality. It is well suited for
heterogeneous data sets, helping to keep EMD based
queries tractable as uncertain data sets become larger
and more complex.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Qumsiyeh:2011:GER,
author = "Rani Qumsiyeh and Maria S. Pera and Yiu-Kai Ng",
title = "Generating exact- and ranked partially-matched answers
to questions in advertisements",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "3",
pages = "217--228",
month = nov,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Sat Mar 24 07:52:09 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "Taking advantage of the Web, many advertisements (ads
for short) websites, which aspire to increase client's
transactions and thus profits, offer searching tools
which allow users to (i) post keyword queries to
capture their information needs or (ii) invoke
form-based interfaces to create queries by selecting
search options, such as a price range, filled-in
entries, check boxes, or drop-down menus. These search
mechanisms, however, are inadequate, since they cannot
be used to specify a natural-language query with rich
syntactic and semantic content, which can only be
handled by a question answering (QA) system.
Furthermore, existing ads websites are incapable of
evaluating arbitrary Boolean queries or retrieving
partially-matched answers that might be of interest to
the user whenever a user's search yields only a few or
no results at all. In solving these problems, we
present a QA system for ads, called CQAds, which (i)
allows users to post a natural-language question Q for
retrieving relevant ads, if they exist, (ii) identifies
ads as answers that partially-match the requested
information expressed in Q, if insufficient or no
answers to Q can be retrieved, which are ordered using
a similarity-ranking approach, and (iii) analyzes
incomplete or ambiguous questions to perform the ``best
guess'' in retrieving answers that ``best match'' the
selection criteria specified in Q. CQAds is also
equipped with a Boolean model to evaluate Boolean
operators that are either explicitly or implicitly
specified in Q, i.e., with or without Boolean operators
specified by the users, respectively. CQAds is easy to
use, scalable to all ads domains, and more powerful
than search tools provided by existing ads websites,
since its query-processing strategy retrieves relevant
ads of higher quality and quantity. We have verified
the accuracy of CQAds in retrieving ads on eight ads
domains and compared its ranking strategy with other
well-known ranking approaches.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Fakas:2011:SOS,
author = "Georgios J. Fakas and Zhi Cai and Nikos Mamoulis",
title = "Size-$l$ object summaries for relational keyword
search",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "3",
pages = "229--240",
month = nov,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Sat Mar 24 07:52:09 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "A previously proposed keyword search paradigm
produces, as a query result, a ranked list of Object
Summaries (OSs). An OS is a tree structure of related
tuples that summarizes all data held in a relational
database about a particular Data Subject (DS). However,
some of these OSs are very large in size and therefore
unfriendly to users that initially prefer synoptic
information before proceeding to more comprehensive
information about a particular DS. In this paper, we
investigate the effective and efficient retrieval of
concise and informative OSs. We argue that a good size-
l OS should be a stand-alone and meaningful synopsis of
the most important information about the particular DS.
More precisely, we define a size- l OS as a partial OS
composed of l important tuples. We propose three
algorithms for the efficient generation of size- l OSs
(in addition to the optimal approach which requires
exponential time). Experimental evaluation on DBLP and
TPC-H databases verifies the effectiveness and
efficiency of our approach.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Fang:2011:RER,
author = "Lujun Fang and Anish Das Sarma and Cong Yu and Philip
Bohannon",
title = "{REX}: explaining relationships between entity pairs",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "3",
pages = "241--252",
month = nov,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Sat Mar 24 07:52:09 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "Knowledge bases of entities and relations (either
constructed manually or automatically) are behind many
real world search engines, including those at Yahoo!,
Microsoft, and Google. Those knowledge bases can be
viewed as graphs with nodes representing entities and
edges representing (primary) relationships, and various
studies have been conducted on how to leverage them to
answer entity seeking queries. Meanwhile, in a
complementary direction, analyses over the query logs
have enabled researchers to identify entity pairs that
are statistically correlated. Such entity relationships
are then presented to search users through the
``related searches'' feature in modern search engines.
However, entity relationships thus discovered can often
be ``puzzling'' to the users because why the entities
are connected is often indescribable. In this paper, we
propose a novel problem called entity relationship
explanation, which seeks to explain why a pair of
entities are connected, and solve this challenging
problem by integrating the above two complementary
approaches, i.e., we leverage the knowledge base to
``explain'' the connections discovered between entity
pairs. More specifically, we present REX, a system that
takes a pair of entities in a given knowledge base as
input and efficiently identifies a ranked list of
relationship explanations. We formally define
relationship explanations and analyze their desirable
properties. Furthermore, we design and implement
algorithms to efficiently enumerate and rank all
relationship explanations based on multiple measures of
``interestingness.'' We perform extensive experiments
over real web-scale data gathered from DBpedia and a
commercial search engine, demonstrating the efficiency
and scalability of REX. We also perform user studies to
corroborate the effectiveness of explanations generated
by REX.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Li:2011:PJP,
author = "Guoliang Li and Dong Deng and Jiannan Wang and Jianhua
Feng",
title = "Pass-join: a partition-based method for similarity
joins",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "3",
pages = "253--264",
month = nov,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Sat Mar 24 07:52:09 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "As an essential operation in data cleaning, the
similarity join has attracted considerable attention
from the database community. In this paper, we study
string similarity joins with edit-distance constraints,
which find similar string pairs from two large sets of
strings whose edit distance is within a given
threshold. Existing algorithms are efficient either for
short strings or for long strings, and there is no
algorithm that can efficiently and adaptively support
both short strings and long strings. To address this
problem, we propose a partition-based method called
Pass-Join. Pass-Join partitions a string into a set of
segments and creates inverted indices for the segments.
Then for each string, Pass-Join selects some of its
substrings and uses the selected substrings to find
candidate pairs using the inverted indices. We devise
efficient techniques to select the substrings and prove
that our method can minimize the number of selected
substrings. We develop novel pruning techniques to
efficiently verify the candidate pairs. Experimental
results show that our algorithms are efficient for both
short strings and long strings, and outperform
state-of-the-art methods on real datasets.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Hoobin:2011:RLZ,
author = "Christopher Hoobin and Simon J. Puglisi and Justin
Zobel",
title = "Relative {Lempel--Ziv} factorization for efficient
storage and retrieval of {Web} collections",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "3",
pages = "265--273",
month = nov,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Sat Mar 24 07:52:09 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "Compression techniques that support fast random access
are a core component of any information system. Current
state-of-the-art methods group documents into
fixed-sized blocks and compress each block with a
general-purpose adaptive algorithm such as gzip. Random
access to a specific document then requires
decompression of a block. The choice of block size is
critical: it trades between compression effectiveness
and document retrieval times. In this paper we present
a scalable compression method for large document
collections that allows fast random access. We build a
representative sample of the collection and use it as a
dictionary in a LZ77-like encoding of the rest of the
collection, relative to the dictionary. We demonstrate
on large collections, that using a dictionary as small
as 0.1\% of the collection size, our algorithm is
dramatically faster than previous methods, and in
general gives much better compression.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Zhang:2011:TCE,
author = "Ning Zhang and Junichi Tatemura and Jignesh M. Patel
and Hakan Hacig{\"u}m{\"u}s",
title = "Towards cost-effective storage provisioning for
{DBMSs}",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "4",
pages = "274--285",
month = dec,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Sat Mar 24 07:52:11 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "Data center operators face a bewildering set of
choices when considering how to provision resources on
machines with complex I/O subsystems. Modern I/O
subsystems often have a rich mix of fast, high
performing, but expensive SSDs sitting alongside with
cheaper but relatively slower (for random accesses)
traditional hard disk drives. The data center operators
need to determine how to provision the I/O resources
for specific workloads so as to abide by existing
Service Level Agreements (SLAs), while minimizing the
total operating cost (TOC) of running the workload,
where the TOC includes the amortized hardware costs and
the run time energy costs. The focus of this paper is
on introducing this new problem of TOC-based storage
allocation, cast in a framework that is compatible with
traditional DBMS query optimization and query
processing architecture. We also present a
heuristic-based solution to this problem, called DOT.
We have implemented DOT in PostgreSQL, and experiments
using TPC-H and TPC-C demonstrate significant TOC
reduction by DOT in various settings.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Roh:2011:BTI,
author = "Hongchan Roh and Sanghyun Park and Sungho Kim and
Mincheol Shin and Sang-Won Lee",
title = "{B+}-tree index optimization by exploiting internal
parallelism of flash-based solid state drives",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "4",
pages = "286--297",
month = dec,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Sat Mar 24 07:52:11 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "Previous research addressed the potential problems of
the hard-disk oriented design of DBMSs of flashSSDs. In
this paper, we focus on exploiting potential benefits
of flashSSDs. First, we examine the internal
parallelism issues of flashSSDs by conducting
benchmarks to various flashSSDs. Then, we suggest
algorithm-design principles in order to best benefit
from the internal parallelism. We present a new I/O
request concept, called psync I/O that can exploit the
internal parallelism of flashSSDs in a single process.
Based on these ideas, we introduce B+-tree optimization
methods in order to utilize internal parallelism. By
integrating the results of these methods, we present a
B+-tree variant, PIO B-tree. We confirmed that each
optimization method substantially enhances the index
performance. Consequently, PIO B-tree enhanced
B+-tree's insert performance by a factor of up to 16.3,
while improving point-search performance by a factor of
1.2. The range search of PIO B-tree was up to 5 times
faster than that of the B+-tree. Moreover, PIO B-tree
outperformed other flash-aware indexes in various
synthetic workloads. We also confirmed that PIO B-tree
outperforms B+-tree in index traces collected inside
the PostgreSQL DBMS with TPC-C benchmark.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Larson:2011:HPC,
author = "Per-{\AA}ke Larson and Spyros Blanas and Cristian
Diaconu and Craig Freedman and Jignesh M. Patel and
Mike Zwilling",
title = "High-performance concurrency control mechanisms for
main-memory databases",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "4",
pages = "298--309",
month = dec,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Sat Mar 24 07:52:11 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "A database system optimized for in-memory storage can
support much higher transaction rates than current
systems. However, standard concurrency control methods
used today do not scale to the high transaction rates
achievable by such systems. In this paper we introduce
two efficient concurrency control methods specifically
designed for main-memory databases. Both use
multiversioning to isolate read-only transactions from
updates but differ in how atomicity is ensured: one is
optimistic and one is pessimistic. To avoid expensive
context switching, transactions never block during
normal processing but they may have to wait before
commit to ensure correct serialization ordering. We
also implemented a main-memory optimized version of
single-version locking. Experimental results show that
while single-version locking works well when
transactions are short and contention is low
performance degrades under more demanding conditions.
The multiversion schemes have higher overhead but are
much less sensitive to hotspots and the presence of
long-running transactions.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Ma:2011:CTG,
author = "Shuai Ma and Yang Cao and Wenfei Fan and Jinpeng Huai
and Tianyu Wo",
title = "Capturing topology in graph pattern matching",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "4",
pages = "310--321",
month = dec,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Sat Mar 24 07:52:11 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "Graph pattern matching is often defined in terms of
subgraph isomorphism, an np-complete problem. To lower
its complexity, various extensions of graph simulation
have been considered instead. These extensions allow
pattern matching to be conducted in cubic-time.
However, they fall short of capturing the topology of
data graphs, i.e., graphs may have a structure
drastically different from pattern graphs they match,
and the matches found are often too large to understand
and analyze. To rectify these problems, this paper
proposes a notion of strong simulation, a revision of
graph simulation, for graph pattern matching. (1) We
identify a set of criteria for preserving the topology
of graphs matched. We show that strong simulation
preserves the topology of data graphs and finds a
bounded number of matches. (2) We show that strong
simulation retains the same complexity as earlier
extensions of simulation, by providing a cubic-time
algorithm for computing strong simulation. (3) We
present the locality property of strong simulation,
which allows us to effectively conduct pattern matching
on distributed graphs. (4) We experimentally verify the
effectiveness and efficiency of these algorithms, using
real-life data and synthetic data.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Kumar:2011:PMO,
author = "Arun Kumar and Christopher R{\'e}",
title = "Probabilistic management of {OCR} data using an
{RDBMS}",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "4",
pages = "322--333",
month = dec,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Sat Mar 24 07:52:11 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "The digitization of scanned forms and documents is
changing the data sources that enterprises manage. To
integrate these new data sources with enterprise data,
the current state-of-the-art approach is to convert the
images to ASCII text using optical character
recognition (OCR) software and then to store the
resulting ASCII text in a relational database. The OCR
problem is challenging, and so the output of OCR often
contains errors. In turn, queries on the output of OCR
may fail to retrieve relevant answers. State-of-the-art
OCR programs, e.g., the OCR powering Google Books, use
a probabilistic model that captures many alternatives
during the OCR process. Only when the results of OCR
are stored in the database, do these approaches discard
the uncertainty. In this work, we propose to retain the
probabilistic models produced by OCR process in a
relational database management system. A key technical
challenge is that the probabilistic data produced by
OCR software is very large (a single book blows up to
2GB from 400kB as ASCII). As a result, a baseline
solution that integrates these models with an RDBMS is
over 1000x slower versus standard text processing for
single table select-project queries. However, many
applications may have quality-performance needs that
are in between these two extremes of ASCII and the
complete model output by the OCR software. Thus, we
propose a novel approximation scheme called Staccato
that allows a user to trade recall for query
performance. Additionally, we provide a formal analysis
of our scheme's properties, and describe how we
integrate our scheme with standard-RDBMS text
indexing.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Pawlik:2011:RRA,
author = "Mateusz Pawlik and Nikolaus Augsten",
title = "{RTED}: a robust algorithm for the tree edit
distance",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "4",
pages = "334--345",
month = dec,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Sat Mar 24 07:52:11 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "We consider the classical tree edit distance between
ordered labeled trees, which is defined as the
minimum-cost sequence of node edit operations that
transform one tree into another. The state-of-the-art
solutions for the tree edit distance are not
satisfactory. The main competitors in the field either
have optimal worst-case complexity, but the worst case
happens frequently, or they are very efficient for some
tree shapes, but degenerate for others. This leads to
unpredictable and often infeasible runtimes. There is
no obvious way to choose between the algorithms. In
this paper we present RTED, a robust tree edit distance
algorithm. The asymptotic complexity of RTED is smaller
or equal to the complexity of the best competitors for
any input instance, i.e., RTED is both efficient and
worst-case optimal. We introduce the class of LRH
(Left-Right-Heavy) algorithms, which includes RTED and
the fastest tree edit distance algorithms presented in
literature. We prove that RTED outperforms all
previously proposed LRH algorithms in terms of runtime
complexity. In our experiments on synthetic and real
world data we empirically evaluate our solution and
compare it to the state-of-the-art.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Amsterdamer:2011:PLP,
author = "Yael Amsterdamer and Susan B. Davidson and Daniel
Deutch and Tova Milo and Julia Stoyanovich and Val
Tannen",
title = "Putting lipstick on pig: enabling database-style
workflow provenance",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "4",
pages = "346--357",
month = dec,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Sat Mar 24 07:52:11 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "Workflow provenance typically assumes that each module
is a ``black-box'', so that each output depends on all
inputs (coarse-grained dependencies). Furthermore, it
does not model the internal state of a module, which
can change between repeated executions. In practice,
however, an output may depend on only a small subset of
the inputs (fine-grained dependencies) as well as on
the internal state of the module. We present a novel
provenance framework that marries database-style and
workflow-style provenance, by using Pig Latin to expose
the functionality of modules, thus capturing internal
state and fine-grained dependencies. A critical
ingredient in our solution is the use of a novel form
of provenance graph that models module invocations and
yields a compact representation of fine-grained
workflow provenance. It also enables a number of novel
graph transformation operations, allowing to choose the
desired level of granularity in provenance querying
(ZoomIn and ZoomOut), and supporting ``what-if''
workflow analytic queries. We implemented our approach
in the Lipstick system and developed a benchmark in
support of a systematic performance evaluation. Our
results demonstrate the feasibility of tracking and
querying fine-grained workflow provenance.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Gao:2011:RAS,
author = "Jun Gao and Ruoming Jin and Jiashuai Zhou and Jeffrey
Xu Yu and Xiao Jiang and Tengjiao Wang",
title = "Relational approach for shortest path discovery over
large graphs",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "4",
pages = "358--369",
month = dec,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Sat Mar 24 07:52:11 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "With the rapid growth of large graphs, we cannot
assume that graphs can still be fully loaded into
memory, thus the disk-based graph operation is
inevitable. In this paper, we take the shortest path
discovery as an example to investigate the technique
issues when leveraging existing infrastructure of
relational database (RDB) in the graph data management.
Based on the observation that a variety of graph search
queries can be implemented by iterative operations
including selecting frontier nodes from visited nodes,
making expansion from the selected frontier nodes, and
merging the expanded nodes into the visited ones, we
introduce a relational FEM framework with three
corresponding operators to implement graph search tasks
in the RDB context. We show new features such as window
function and merge statement introduced by recent SQL
standards can not only simplify the expression but also
improve the performance of the FEM framework. In
addition, we propose two optimization strategies
specific to shortest path discovery inside the FEM
framework. First, we take a bi-directional set
Dijkstra's algorithm in the path finding. The
bi-directional strategy can reduce the search space,
and set Dijkstra's algorithm finds the shortest path in
a set-at-a-time fashion. Second, we introduce an index
named SegTable to preserve the local shortest segments,
and exploit SegTable to further improve the
performance. The final extensive experimental results
illustrate our relational approach with the
optimization strategies achieves high scalability and
performance.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Barsky:2011:MFC,
author = "Marina Barsky and Sangkyum Kim and Tim Weninger and
Jiawei Han",
title = "Mining flipping correlations from large datasets with
taxonomies",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "4",
pages = "370--381",
month = dec,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Sat Mar 24 07:52:11 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "In this paper we introduce a new type of pattern --- a
flipping correlation pattern. The flipping patterns are
obtained from contrasting the correlations between
items at different levels of abstraction. They
represent surprising correlations, both positive and
negative, which are specific for a given abstraction
level, and which ``flip'' from positive to negative and
vice versa when items are generalized to a higher level
of abstraction. We design an efficient algorithm for
finding flipping correlations, the Flipper algorithm,
which outperforms na{\"\i}ve pattern mining methods by
several orders of magnitude. We apply Flipper to
real-life datasets and show that the discovered
patterns are non-redundant, surprising and actionable.
Flipper finds strong contrasting correlations in
itemsets with low-to-medium support, while existing
techniques cannot handle the pattern discovery in this
frequency range.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Konig:2011:SAT,
author = "Arnd Christian K{\"o}nig and Bolin Ding and Surajit
Chaudhuri and Vivek Narasayya",
title = "A statistical approach towards robust progress
estimation",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "4",
pages = "382--393",
month = dec,
year = "2011",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Sat Mar 24 07:52:11 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "The need for accurate SQL progress estimation in the
context of decision support administration has led to a
number of techniques proposed for this task.
Unfortunately, no single one of these progress
estimators behaves robustly across the variety of SQL
queries encountered in practice, meaning that each
technique performs poorly for a significant fraction of
queries. This paper proposes a novel estimator
selection framework that uses a statistical model to
characterize the sets of conditions under which certain
estimators outperform others, leading to a significant
increase in estimation robustness. The generality of
this framework also enables us to add a number of novel
``special purpose'' estimators which increase accuracy
further. Most importantly, the resulting model
generalizes well to queries very different from the
ones used to train it. We validate our findings using a
large number of industrial real-life and benchmark
workloads.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Sun:2012:RSA,
author = "Yizhou Sun and Charu C. Aggarwal and Jiawei Han",
title = "Relation strength-aware clustering of heterogeneous
information networks with incomplete attributes",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "5",
pages = "394--405",
month = jan,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Sat Mar 24 07:52:13 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "With the rapid development of online social media,
online shopping sites and cyber-physical systems,
heterogeneous information networks have become
increasingly popular and content-rich over time. In
many cases, such networks contain multiple types of
objects and links, as well as different kinds of
attributes. The clustering of these objects can provide
useful insights in many applications. However, the
clustering of such networks can be challenging since
(a) the attribute values of objects are often
incomplete, which implies that an object may carry only
partial attributes or even no attributes to correctly
label itself; and (b) the links of different types may
carry different kinds of semantic meanings, and it is a
difficult task to determine the nature of their
relative importance in helping the clustering for a
given purpose. In this paper, we address these
challenges by proposing a model-based clustering
algorithm. We design a probabilistic model which
clusters the objects of different types into a common
hidden space, by using a user-specified set of
attributes, as well as the links from different
relations. The strengths of different types of links
are automatically learned, and are determined by the
given purpose of clustering. An iterative algorithm is
designed for solving the clustering problem, in which
the strengths of different types of links and the
quality of clustering results mutually enhance each
other. Our experimental results on real and synthetic
data sets demonstrate the effectiveness and efficiency
of the algorithm.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Wu:2012:SPD,
author = "Lingkun Wu and Xiaokui Xiao and Dingxiong Deng and Gao
Cong and Andy Diwen Zhu and Shuigeng Zhou",
title = "Shortest path and distance queries on road networks:
an experimental evaluation",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "5",
pages = "406--417",
month = jan,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Sat Mar 24 07:52:13 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "Computing the shortest path between two given
locations in a road network is an important problem
that finds applications in various map services and
commercial navigation products. The state-of-the-art
solutions for the problem can be divided into two
categories: spatial-coherence-based methods and
vertex-importance-based approaches. The two categories
of techniques, however, have not been compared
systematically under the same experimental framework,
as they were developed from two independent lines of
research that do not refer to each other. This renders
it difficult for a practitioner to decide which
technique should be adopted for a specific application.
Furthermore, the experimental evaluation of the
existing techniques, as presented in previous work,
falls short in several aspects. Some methods were
tested only on small road networks with up to one
hundred thousand vertices; some approaches were
evaluated using distance queries (instead of shortest
path queries), namely, queries that ask only for the
length of the shortest path; a state-of-the-art
technique was examined based on a faulty implementation
that led to incorrect query results. To address the
above issues, this paper presents a comprehensive
comparison of the most advanced spatial-coherence-based
and vertex-importance-based approaches. Using a variety
of real road networks with up to twenty million
vertices, we evaluated each technique in terms of its
preprocessing time, space consumption, and query
efficiency (for both shortest path and distance
queries). Our experimental results reveal the
characteristics of different techniques, based on which
we provide guidelines on selecting appropriate methods
for various scenarios.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Erdos:2012:FPP,
author = "D{\'o}ra Erd{\H{o}}s and Vatche Ishakian and Andrei
Lapets and Evimaria Terzi and Azer Bestavros",
title = "The filter-placement problem and its application to
minimizing information multiplicity",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "5",
pages = "418--429",
month = jan,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Sat Mar 24 07:52:13 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "In many information networks, data items --- such as
updates in social networks, news flowing through
interconnected RSS feeds and blogs, measurements in
sensor networks, route updates in ad-hoc networks ---
propagate in an uncoordinated manner: nodes often relay
information they receive to neighbors, independent of
whether or not these neighbors received the same
information from other sources. This uncoordinated data
dissemination may result in significant, yet
unnecessary communication and processing overheads,
ultimately reducing the utility of information
networks. To alleviate the negative impacts of this
information multiplicity phenomenon, we propose that a
subset of nodes (selected at key positions in the
network) carry out additional information filtering
functionality. Thus, nodes are responsible for the
removal (or significant reduction) of the redundant
data items relayed through them. We refer to such nodes
as filters. We formally define the Filter Placement
problem as a combinatorial optimization problem, and
study its computational complexity for different types
of graphs. We also present polynomial-time
approximation algorithms and scalable heuristics for
the problem. Our experimental results, which we
obtained through extensive simulations on synthetic and
real-world information flow networks, suggest that in
many settings a relatively small number of filters are
fairly effective in removing a large fraction of
redundant information.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Satuluri:2012:BLS,
author = "Venu Satuluri and Srinivasan Parthasarathy",
title = "{Bayesian} locality sensitive hashing for fast
similarity search",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "5",
pages = "430--441",
month = jan,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Sat Mar 24 07:52:13 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "Given a collection of objects and an associated
similarity measure, the all-pairs similarity search
problem asks us to find all pairs of objects with
similarity greater than a certain user-specified
threshold. Locality-sensitive hashing (LSH) based
methods have become a very popular approach for this
problem. However, most such methods only use LSH for
the first phase of similarity search --- i.e. efficient
indexing for candidate generation. In this paper, we
present BayesLSH, a principled Bayesian algorithm for
the subsequent phase of similarity search ---
performing candidate pruning and similarity estimation
using LSH. A simpler variant, BayesLSH-Lite, which
calculates similarities exactly, is also presented. Our
algorithms are able to quickly prune away a large
majority of the false positive candidate pairs, leading
to significant speedups over baseline approaches. For
BayesLSH, we also provide probabilistic guarantees on
the quality of the output, both in terms of accuracy
and recall. Finally, the quality of BayesLSH's output
can be easily tuned and does not require any manual
setting of the number of hashes to use for similarity
estimation, unlike standard approaches. For two
state-of-the-art candidate generation algorithms,
AllPairs and LSH, BayesLSH enables significant
speedups, typically in the range 2x-20x for a wide
variety of datasets.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Fujiwara:2012:FET,
author = "Yasuhiro Fujiwara and Makoto Nakatsuji and Makoto
Onizuka and Masaru Kitsuregawa",
title = "Fast and exact top-$k$ search for random walk with
restart",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "5",
pages = "442--453",
month = jan,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Sat Mar 24 07:52:13 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "Graphs are fundamental data structures and have been
employed for centuries to model real-world systems and
phenomena. Random walk with restart (RWR) provides a
good proximity score between two nodes in a graph, and
it has been successfully used in many applications such
as automatic image captioning, recommender systems, and
link prediction. The goal of this work is to find nodes
that have top-$k$ highest proximities for a given node.
Previous approaches to this problem find nodes
efficiently at the expense of exactness. The main
motivation of this paper is to answer, in the
affirmative, the question, 'Is it possible to improve
the search time without sacrificing the exactness?'.
Our solution, K-dash, is based on two ideas: (1) It
computes the proximity of a selected node efficiently
by sparse matrices, and (2) It skips unnecessary
proximity computations when searching for the top-$k$
nodes. Theoretical analyses show that K-dash guarantees
result exactness. We perform comprehensive experiments
to verify the efficiency of K-dash. The results show
that K-dash can find top-$k$ nodes significantly faster
than the previous approaches while it guarantees
exactness.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Bahmani:2012:DSS,
author = "Bahman Bahmani and Ravi Kumar and Sergei
Vassilvitskii",
title = "Densest subgraph in streaming and {MapReduce}",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "5",
pages = "454--465",
month = jan,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Sat Mar 24 07:52:13 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "The problem of finding locally dense components of a
graph is an important primitive in data analysis, with
wide-ranging applications from community mining to spam
detection and the discovery of biological network
modules. In this paper we present new algorithms for
finding the densest subgraph in the streaming model.
For any $ \epsilon > 0 $, our algorithms make $
O(\log_{1 + \epsilon } n) $ passes over the input and
find a subgraph whose density is guaranteed to be
within a factor $ 2 (1 + \epsilon) $ of the optimum.
Our algorithms are also easily parallelizable and we
illustrate this by realizing them in the MapReduce
model. In addition we perform extensive experimental
evaluation on massive real-world graphs showing the
performance and scalability of our algorithms in
practice.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Silva:2012:MAS,
author = "Arlei Silva and Wagner {Meira, Jr.} and Mohammed J.
Zaki",
title = "Mining attribute-structure correlated patterns in
large attributed graphs",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "5",
pages = "466--477",
month = jan,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Sat Mar 24 07:52:13 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "In this work, we study the correlation between
attribute sets and the occurrence of dense subgraphs in
large attributed graphs, a task we call structural
correlation pattern mining. A structural correlation
pattern is a dense subgraph induced by a particular
attribute set. Existing methods are not able to extract
relevant knowledge regarding how vertex attributes
interact with dense subgraphs. Structural correlation
pattern mining combines aspects of frequent itemset and
quasi-clique mining problems. We propose statistical
significance measures that compare the structural
correlation of attribute sets against their expected
values using null models. Moreover, we evaluate the
interestingness of structural correlation patterns in
terms of size and density. An efficient algorithm that
combines search and pruning strategies in the
identification of the most relevant structural
correlation patterns is presented. We apply our method
for the analysis of three real-world attributed graphs:
a collaboration, a music, and a citation network,
verifying that it provides valuable knowledge in a
feasible time.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Schnaitter:2012:SAI,
author = "Karl Schnaitter and Neoklis Polyzotis",
title = "Semi-automatic index tuning: keeping {DBAs} in the
loop",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "5",
pages = "478--489",
month = jan,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Sat Mar 24 07:52:13 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "To obtain a high level of system performance, a
database administrator (DBA) must choose a set of
indices that is appropriate for the workload. The
system can aid in this challenging task by providing
recommendations for the index configuration. We propose
a new index recommendation technique, termed
semi-automatic tuning, that keeps the DBA ``in the
loop'' by generating recommendations that use feedback
about the DBA's preferences. The technique also works
online, which avoids the limitations of commercial
tools that require the workload to be known in advance.
The foundation of our approach is the Work Function
Algorithm, which can solve a wide variety of online
optimization problems with strong competitive
guarantees. We present an experimental analysis that
validates the benefits of semi-automatic tuning in a
wide variety of conditions.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Fink:2012:APD,
author = "Robert Fink and Larisa Han and Dan Olteanu",
title = "Aggregation in probabilistic databases via knowledge
compilation",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "5",
pages = "490--501",
month = jan,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Sat Mar 24 07:52:13 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "This paper presents a query evaluation technique for
positive relational algebra queries with aggregates on
a representation system for probabilistic data based on
the algebraic structures of semiring and semimodule.
The core of our evaluation technique is a procedure
that compiles semimodule and semiring expressions into
so-called decomposition trees, for which the
computation of the probability distribution can be done
in time linear in the product of the sizes of the
probability distributions represented by its nodes. We
give syntactic characterisations of tractable queries
with aggregates by exploiting the connection between
query tractability and polynomial-time decomposition
trees. A prototype of the technique is incorporated in
the probabilistic database engine SPROUT. We report on
performance experiments with custom datasets and TPC-H
data.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Halim:2012:SDC,
author = "Felix Halim and Stratos Idreos and Panagiotis Karras
and Roland H. C. Yap",
title = "Stochastic database cracking: towards robust adaptive
indexing in main-memory column-stores",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "6",
pages = "502--513",
month = feb,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Sat Mar 24 07:52:15 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "Modern business applications and scientific databases
call for inherently dynamic data storage environments.
Such environments are characterized by two challenging
features: (a) they have little idle system time to
devote on physical design; and (b) there is little, if
any, a priori workload knowledge, while the query and
data workload keeps changing dynamically. In such
environments, traditional approaches to index building
and maintenance cannot apply. Database cracking has
been proposed as a solution that allows on-the-fly
physical data reorganization, as a collateral effect of
query processing. Cracking aims to continuously and
automatically adapt indexes to the workload at hand,
without human intervention. Indexes are built
incrementally, adaptively, and on demand. Nevertheless,
as we show, existing adaptive indexing methods fail to
deliver workload-robustness; they perform much better
with random workloads than with others. This frailty
derives from the inelasticity with which these
approaches interpret each query as a hint on how data
should be stored. Current cracking schemes blindly
reorganize the data within each query's range, even if
that results into successive expensive operations with
minimal indexing benefit. In this paper, we introduce
stochastic cracking, a significantly more resilient
approach to adaptive indexing. Stochastic cracking also
uses each query as a hint on how to reorganize data,
but not blindly so; it gains resilience and avoids
performance bottlenecks by deliberately applying
certain arbitrary choices in its decision-making.
Thereby, we bring adaptive indexing forward to a mature
formulation that confers the workload-robustness
previous approaches lacked. Our extensive experimental
study verifies that stochastic cracking maintains the
desired properties of original database cracking while
at the same time it performs well with diverse
realistic workloads.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Li:2012:AMA,
author = "Chao Li and Gerome Miklau",
title = "An adaptive mechanism for accurate query answering
under differential privacy",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "6",
pages = "514--525",
month = feb,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Sat Mar 24 07:52:15 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "We propose a novel mechanism for answering sets of
counting queries under differential privacy. Given a
workload of counting queries, the mechanism
automatically selects a different set of ``strategy''
queries to answer privately, using those answers to
derive answers to the workload. The main algorithm
proposed in this paper approximates the optimal
strategy for any workload of linear counting queries.
With no cost to the privacy guarantee, the mechanism
improves significantly on prior approaches and achieves
near-optimal error for many workloads, when applied
under $ (\epsilon, \delta)$-differential privacy. The
result is an adaptive mechanism which can help users
achieve good utility without requiring that they reason
carefully about the best formulation of their task.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Giannikis:2012:SKO,
author = "Georgios Giannikis and Gustavo Alonso and Donald
Kossmann",
title = "{SharedDB}: killing one thousand queries with one
stone",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "6",
pages = "526--537",
month = feb,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Sat Mar 24 07:52:15 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "Traditional database systems are built around the
query-at-a-time model. This approach tries to optimize
performance in a best-effort way. Unfortunately, best
effort is not good enough for many modern applications.
These applications require response time guarantees in
high load situations. This paper describes the design
of a new database architecture that is based on
batching queries and shared computation across possibly
hundreds of concurrent queries and updates. Performance
experiments with the TPC-W benchmark show that the
performance of our implementation, SharedDB, is indeed
robust across a wide range of dynamic workloads.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Selke:2012:PBC,
author = "Joachim Selke and Christoph Lofi and Wolf-Tilo Balke",
title = "Pushing the boundaries of crowd-enabled databases with
query-driven schema expansion",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "6",
pages = "538--549",
month = feb,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Sat Mar 24 07:52:15 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "By incorporating human workers into the query
execution process crowd-enabled databases facilitate
intelligent, social capabilities like completing
missing data at query time or performing cognitive
operators. But despite all their flexibility,
crowd-enabled databases still maintain rigid schemas.
In this paper, we extend crowd-enabled databases by
flexible query-driven schema expansion, allowing the
addition of new attributes to the database at query
time. However, the number of crowd-sourced mini-tasks
to fill in missing values may often be prohibitively
large and the resulting data quality is doubtful.
Instead of simple crowd-sourcing to obtain all values
individually, we leverage the usergenerated data found
in the Social Web: By exploiting user ratings we build
perceptual spaces, i.e., highly-compressed
representations of opinions, impressions, and
perceptions of large numbers of users. Using few
training samples obtained by expert crowd sourcing, we
then can extract all missing data automatically from
the perceptual space with high quality and at low
costs. Extensive experiments show that our approach can
boost both performance and quality of crowd-enabled
databases, while also providing the flexibility to
expand schemas in a query-driven fashion.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Zhao:2012:BAD,
author = "Bo Zhao and Benjamin I. P. Rubinstein and Jim Gemmell
and Jiawei Han",
title = "A {Bayesian} approach to discovering truth from
conflicting sources for data integration",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "6",
pages = "550--561",
month = feb,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Sat Mar 24 07:52:15 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "In practical data integration systems, it is common
for the data sources being integrated to provide
conflicting information about the same entity.
Consequently, a major challenge for data integration is
to derive the most complete and accurate integrated
records from diverse and sometimes conflicting sources.
We term this challenge the truth finding problem. We
observe that some sources are generally more reliable
than others, and therefore a good model of source
quality is the key to solving the truth finding
problem. In this work, we propose a probabilistic
graphical model that can automatically infer true
records and source quality without any supervision. In
contrast to previous methods, our principled approach
leverages a generative process of two types of errors
(false positive and false negative) by modeling two
different aspects of source quality. In so doing, ours
is also the first approach designed to merge
multi-valued attribute types. Our method is scalable,
due to an efficient sampling-based inference algorithm
that needs very few iterations in practice and enjoys
linear time complexity, with an even faster incremental
variant. Experiments on two real world datasets show
that our new method outperforms existing
state-of-the-art approaches to the truth finding
problem.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Upadhyaya:2012:HPS,
author = "Prasang Upadhyaya and Magdalena Balazinska and Dan
Suciu",
title = "How to price shared optimizations in the cloud",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "6",
pages = "562--573",
month = feb,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Sat Mar 24 07:52:15 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "Data-management-as-a-service systems are increasingly
being used in collaborative settings, where multiple
users access common datasets. Cloud providers have the
choice to implement various optimizations, such as
indexing or materialized views, to accelerate queries
over these datasets. Each optimization carries a cost
and may benefit multiple users. This creates a major
challenge: how to select which optimizations to perform
and how to share their cost among users. The problem is
especially challenging when users are selfish and will
only report their true values for different
optimizations if doing so maximizes their utility. In
this paper, we present a new approach for selecting and
pricing shared optimizations by using Mechanism Design.
We first show how to apply the Shapley Value Mechanism
to the simple case of selecting and pricing additive
optimizations, assuming an offline game where all users
access the service for the same time-period. Second, we
extend the approach to online scenarios where users
come and go. Finally, we consider the case of
substitutive optimizations. We show analytically that
our mechanisms induce truthfulness and recover the
optimization costs. We also show experimentally that
our mechanisms yield higher utility than the
state-of-the-art approach based on regret
accumulation.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Angel:2012:DSM,
author = "Albert Angel and Nikos Sarkas and Nick Koudas and
Divesh Srivastava",
title = "Dense subgraph maintenance under streaming edge weight
updates for real-time story identification",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "6",
pages = "574--585",
month = feb,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Sat Mar 24 07:52:15 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "Recent years have witnessed an unprecedented
proliferation of social media. People around the globe
author, every day, millions of blog posts, micro-blog
posts, social network status updates, etc. This rich
stream of information can be used to identify, on an
ongoing basis, emerging stories, and events that
capture popular attention. Stories can be identified
via groups of tightly-coupled real-world entities,
namely the people, locations, products, etc., that are
involved in the story. The sheer scale, and rapid
evolution of the data involved necessitate highly
efficient techniques for identifying important stories
at every point of time. The main challenge in real-time
story identification is the maintenance of dense
subgraphs (corresponding to groups of tightly-coupled
entities) under streaming edge weight updates
(resulting from a stream of user-generated content).
This is the first work to study the efficient
maintenance of dense subgraphs under such streaming
edge weight updates. For a wide range of definitions of
density, we derive theoretical results regarding the
magnitude of change that a single edge weight update
can cause. Based on these, we propose a novel
algorithm, DynDens, which outperforms adaptations of
existing techniques to this setting, and yields
meaningful results. Our approach is validated by a
thorough experimental evaluation on large-scale real
and synthetic datasets.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Elghandour:2012:RRR,
author = "Iman Elghandour and Ashraf Aboulnaga",
title = "{ReStore}: reusing results of {MapReduce} jobs",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "6",
pages = "586--597",
month = feb,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Sat Mar 24 07:52:15 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "Analyzing large scale data has emerged as an important
activity for many organizations in the past few years.
This large scale data analysis is facilitated by the
MapReduce programming and execution model and its
implementations, most notably Hadoop. Users of
MapReduce often have analysis tasks that are too
complex to express as individual MapReduce jobs.
Instead, they use high-level query languages such as
Pig, Hive, or Jaql to express their complex tasks. The
compilers of these languages translate queries into
workflows of MapReduce jobs. Each job in these
workflows reads its input from the distributed file
system used by the MapReduce system and produces output
that is stored in this distributed file system and read
as input by the next job in the workflow. The current
practice is to delete these intermediate results from
the distributed file system at the end of executing the
workflow. One way to improve the performance of
workflows of MapReduce jobs is to keep these
intermediate results and reuse them for future
workflows submitted to the system. In this paper, we
present ReStore, a system that manages the storage and
reuse of such intermediate results. ReStore can reuse
the output of whole MapReduce jobs that are part of a
workflow, and it can also create additional reuse
opportunities by materializing and storing the output
of query execution operators that are executed within a
MapReduce job. We have implemented ReStore as an
extension to the Pig dataflow system on top of Hadoop,
and we experimentally demonstrate significant speedups
on queries from the PigMix benchmark.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Khoussainova:2012:PDM,
author = "Nodira Khoussainova and Magdalena Balazinska and Dan
Suciu",
title = "{PerfXplain}: debugging {MapReduce} job performance",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "7",
pages = "598--609",
month = mar,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Tue Nov 6 16:43:09 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "While users today have access to many tools that
assist in performing large scale data analysis tasks,
understanding the performance characteristics of their
parallel computations, such as MapReduce jobs, remains
difficult. We present PerfXplain, a system that enables
users to ask questions about the relative performances
(i.e., runtimes) of pairs of MapReduce jobs. PerfXplain
provides a new query language for articulating
performance queries and an algorithm for generating
explanations from a log of past MapReduce job
executions. We formally define the notion of an
explanation together with three metrics, relevance,
precision, and generality, that measure explanation
quality. We present the explanation-generation
algorithm based on techniques related to decision-tree
building. We evaluate the approach on a log of past
executions on Amazon EC2, and show that our approach
can generate quality explanations, outperforming two
na{\"\i}ve explanation-generation methods.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Gullo:2012:UCB,
author = "Francesco Gullo and Andrea Tagarelli",
title = "Uncertain centroid based partitional clustering of
uncertain data",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "7",
pages = "610--621",
month = mar,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Tue Nov 6 16:43:09 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "Clustering uncertain data has emerged as a challenging
task in uncertain data management and mining. Thanks to
a computational complexity advantage over other
clustering paradigms, partitional clustering has been
particularly studied and a number of algorithms have
been developed. While existing proposals differ mainly
in the notions of cluster centroid and clustering
objective function, little attention has been given to
an analysis of their characteristics and limits. In
this work, we theoretically investigate major existing
methods of partitional clustering, and alternatively
propose a well-founded approach to clustering uncertain
data based on a novel notion of cluster centroid. A
cluster centroid is seen as an uncertain object defined
in terms of a random variable whose realizations are
derived based on all deterministic representations of
the objects to be clustered. As demonstrated
theoretically and experimentally, this allows for
better representing a cluster of uncertain objects,
thus supporting a consistently improved clustering
performance while maintaining comparable efficiency
with existing partitional clustering algorithms.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Bahmani:2012:SM,
author = "Bahman Bahmani and Benjamin Moseley and Andrea Vattani
and Ravi Kumar and Sergei Vassilvitskii",
title = "Scalable $k$-means$ + + $",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "7",
pages = "622--633",
month = mar,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Tue Nov 6 16:43:09 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "Over half a century old and showing no signs of aging,
$k$-means remains one of the most popular data
processing algorithms. As is well-known, a proper
initialization of $k$-means is crucial for obtaining a
good final solution. The recently proposed $k$-means++
initialization algorithm achieves this, obtaining an
initial set of centers that is provably close to the
optimum solution. A major downside of the $k$-means++
is its inherent sequential nature, which limits its
applicability to massive data: one must make $k$ passes
over the data to find a good initial set of centers. In
this work we show how to drastically reduce the number
of passes needed to obtain, in parallel, a good
initialization. This is unlike prevailing efforts on
parallelizing $k$-means that have mostly focused on the
post-initialization phases of $k$-means. We prove that
our proposed initialization algorithm $k$-means||
obtains a nearly optimal solution after a logarithmic
number of passes, and then show that in practice a
constant number of passes suffices. Experimental
evaluation on real-world large-scale data demonstrates
that $k$-means|| outperforms $k$-means++ in both
sequential and parallel settings.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Benedikt:2012:QSA,
author = "Michael Benedikt and Pierre Bourhis and Clemens Ley",
title = "Querying schemas with access restrictions",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "7",
pages = "634--645",
month = mar,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Tue Nov 6 16:43:09 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "We study verification of systems whose transitions
consist of accesses to a Web-based data-source. An
access is a lookup on a relation within a relational
database, fixing values for a set of positions in the
relation. For example, a transition can represent
access to a Web form, where the user is restricted to
filling in values for a particular set of fields. We
look at verifying properties of a schema describing the
possible accesses of such a system. We present a
language where one can describe the properties of an
access path, and also specify additional restrictions
on accesses that are enforced by the schema. Our main
property language, AccLTL, is based on a first-order
extension of linear-time temporal logic, interpreting
access paths as sequences of relational structures. We
also present a lower-level automaton model, A-automata,
which AccLTL specifications can compile into. We show
that AccLTL and A-automata can express static analysis
problems related to ``querying with limited access
patterns'' that have been studied in the database
literature in the past, such as whether an access is
relevant to answering a query, and whether two queries
are equivalent in the accessible data they can return.
We prove decidability and complexity results for
several restrictions and variants of AccLTL, and
explain which properties of paths can be expressed in
each restriction.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Graefe:2012:DDR,
author = "Goetz Graefe and Harumi Kuno",
title = "Definition, detection, and recovery of single-page
failures, a fourth class of database failures",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "7",
pages = "646--655",
month = mar,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Tue Nov 6 16:43:09 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "The three traditional failure classes are system,
media, and transaction failures. Sometimes, however,
modern storage exhibits failures that differ from all
of those. In order to capture and describe such cases,
single-page failures are introduced as a fourth failure
class. This class encompasses all failures to read a
data page correctly and with plausible contents despite
all correction attempts in lower system levels.
Efficient recovery seems to require a new data
structure called the page recovery index. Its
transactional maintenance can be accomplished writing
the same number of log records as today's efficient
implementations of logging and recovery. Detection and
recovery of a single-page failure can be sufficiently
fast that the affected data access is merely delayed,
without the need to abort the transaction.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Graefe:2012:CCA,
author = "Goetz Graefe and Felix Halim and Stratos Idreos and
Harumi Kuno and Stefan Manegold",
title = "Concurrency control for adaptive indexing",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "7",
pages = "656--667",
month = mar,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Tue Nov 6 16:43:09 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "Adaptive indexing initializes and optimizes indexes
incrementally, as a side effect of query processing.
The goal is to achieve the benefits of indexes while
hiding or minimizing the costs of index creation.
However, index-optimizing side effects seem to turn
read-only queries into update transactions that might,
for example, create lock contention. This paper studies
concurrency control in the context of adaptive
indexing. We show that the design and implementation of
adaptive indexing rigorously separates index structures
from index contents; this relaxes the constraints and
requirements during adaptive indexing compared to those
of traditional index updates. Our design adapts to the
fact that an adaptive index is refined continuously,
and exploits any concurrency opportunities in a dynamic
way. A detailed experimental analysis demonstrates that
(a) adaptive indexing maintains its adaptive properties
even when running concurrent queries, (b) adaptive
indexing can exploit the opportunity for parallelism
due to concurrent queries, (c) the number of
concurrency conflicts and any concurrency
administration overheads follow an adaptive behavior,
decreasing as the workload evolves and adapting to the
workload needs.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Zeng:2012:CSB,
author = "Qiang Zeng and Hai Zhuge",
title = "Comments on {``Stack-based Algorithms for Pattern
Matching on DAGs''}",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "7",
pages = "668--679",
month = mar,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Tue Nov 6 16:43:09 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "The paper ``Stack-based Algorithms for Pattern
Matching on DAGs'' generalizes the classical holistic
twig join algorithms and proposes PathStackD,
TwigStackD and DagStackD to respectively evaluate path,
twig and DAG pattern queries on directed acyclic
graphs. In this paper, we investigate the major results
of that paper, pointing out several discrepancies and
proposing solutions to resolving them. We show that the
original algorithms do not find particular types of
query solutions that are common in practice. We also
analyze the effect of an underlying assumption on the
correctness of the algorithms and discuss the
pre-filtering process that the original work proposes
to prune redundant nodes. Our experimental study on
both real and synthetic data substantiates our
conclusions.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Dalvi:2012:ASD,
author = "Nilesh Dalvi and Ashwin Machanavajjhala and Bo Pang",
title = "An analysis of structured data on the web",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "7",
pages = "680--691",
month = mar,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Tue Nov 6 16:43:09 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "In this paper, we analyze the nature and distribution
of structured data on the Web. Web-scale information
extraction, or the problem of creating structured
tables using extraction from the entire web, is
gathering lots of research interest. We perform a study
to understand and quantify the value of Web-scale
extraction, and how structured information is
distributed amongst top aggregator websites and tail
sites for various interesting domains. We believe this
is the first study of its kind, and gives us new
insights for information extraction over the Web.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Mouratidis:2012:SPC,
author = "Kyriakos Mouratidis and Man Lung Yiu",
title = "Shortest path computation with no information
leakage",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "8",
pages = "692--703",
month = apr,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Tue Nov 6 16:43:10 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "Shortest path computation is one of the most common
queries in location-based services (LBSs). Although
particularly useful, such queries raise serious privacy
concerns. Exposing to a (potentially untrusted) LBS the
client's position and her destination may reveal
personal information, such as social habits, health
condition, shopping preferences, lifestyle choices,
etc. The only existing method for privacy-preserving
shortest path computation follows the obfuscation
paradigm; it prevents the LBS from inferring the source
and destination of the query with a probability higher
than a threshold. This implies, however, that the LBS
still deduces some information (albeit not exact) about
the client's location and her destination. In this
paper we aim at strong privacy, where the adversary
learns nothing about the shortest path query. We
achieve this via established private information
retrieval techniques, which we treat as black-box
building blocks. Experiments on real, large-scale road
networks assess the practicality of our schemes.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Metwally:2012:VSJ,
author = "Ahmed Metwally and Christos Faloutsos",
title = "{V-SMART-join}: a scalable {MapReduce} framework for
all-pair similarity joins of multisets and vectors",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "8",
pages = "704--715",
month = apr,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Tue Nov 6 16:43:10 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "This work proposes V-SMART-Join, a scalable
MapReduce-based framework for discovering all pairs of
similar entities. The V-SMART-Join framework is
applicable to sets, multisets, and vectors.
V-SMART-Join is motivated by the observed skew in the
underlying distributions of Internet traffic, and is a
family of 2-stage algorithms, where the first stage
computes and joins the partial results, and the second
stage computes the similarity exactly for all candidate
pairs. The V-SMART-Join algorithms are very efficient
and scalable in the number of entities, as well as
their cardinalities. They were up to 30 times faster
than the state of the art algorithm, VCL, when compared
on a real dataset of a small size. We also established
the scalability of the proposed algorithms by running
them on a dataset of a realistic size, on which VCL
never succeeded to finish. Experiments were run using
real datasets of IPs and cookies, where each IP is
represented as a multiset of cookies, and the goal is
to discover similar IPs to identify Internet proxies.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Low:2012:DGF,
author = "Yucheng Low and Danny Bickson and Joseph Gonzalez and
Carlos Guestrin and Aapo Kyrola and Joseph M.
Hellerstein",
title = "{Distributed GraphLab}: a framework for machine
learning and data mining in the cloud",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "8",
pages = "716--727",
month = apr,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Tue Nov 6 16:43:10 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "While high-level data parallel frameworks, like
MapReduce, simplify the design and implementation of
large-scale data processing systems, they do not
naturally or efficiently support many important data
mining and machine learning algorithms and can lead to
inefficient learning systems. To help fill this
critical void, we introduced the GraphLab abstraction
which naturally expresses asynchronous, dynamic,
graph-parallel computation while ensuring data
consistency and achieving a high degree of parallel
performance in the shared-memory setting. In this
paper, we extend the GraphLab framework to the
substantially more challenging distributed setting
while preserving strong data consistency guarantees. We
develop graph based extensions to pipelined locking and
data versioning to reduce network congestion and
mitigate the effect of network latency. We also
introduce fault tolerance to the GraphLab abstraction
using the classic Chandy-Lamport snapshot algorithm and
demonstrate how it can be easily implemented by
exploiting the GraphLab abstraction itself. Finally, we
evaluate our distributed implementation of the GraphLab
abstraction on a large Amazon EC2 deployment and show
1-2 orders of magnitude performance gains over
Hadoop-based implementations.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Zeng:2012:ALO,
author = "Qiang Zeng and Xiaorui Jiang and Hai Zhuge",
title = "Adding logical operators to tree pattern queries on
graph-structured data",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "8",
pages = "728--739",
month = apr,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Tue Nov 6 16:43:10 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "As data are increasingly modeled as graphs for
expressing complex relationships, the tree pattern
query on graph-structured data becomes an important
type of queries in real-world applications. Most
practical query languages, such as XQuery and SPARQL,
support logical expressions using logical-AND/OR/NOT
operators to define structural constraints of tree
patterns. In this paper, (1) we propose generalized
tree pattern queries (GTPQs) over graph-structured
data, which fully support propositional logic of
structural constraints. (2) We make a thorough study of
fundamental problems including satisfiability,
containment and minimization, and analyze the
computational complexity and the decision procedures of
these problems. (3) We propose a compact graph
representation of intermediate results and a pruning
approach to reduce the size of intermediate results and
the number of join operations --- two factors that
often impair the efficiency of traditional algorithms
for evaluating tree pattern queries. (4) We present an
efficient algorithm for evaluating GTPQs using 3-hop as
the underlying reachability index. (5) Experiments on
both real-life and synthetic data sets demonstrate the
effectiveness and efficiency of our algorithm, from
several times to orders of magnitude faster than
state-of-the-art algorithms in terms of evaluation
time, even for traditional tree pattern queries with
only conjunctive operations.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Singh:2012:LSS,
author = "Rishabh Singh and Sumit Gulwani",
title = "Learning semantic string transformations from
examples",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "8",
pages = "740--751",
month = apr,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Tue Nov 6 16:43:10 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "We address the problem of performing semantic
transformations on strings, which may represent a
variety of data types (or their combination) such as a
column in a relational table, time, date, currency,
etc. Unlike syntactic transformations, which are based
on regular expressions and which interpret a string as
a sequence of characters, semantic transformations
additionally require exploiting the semantics of the
data type represented by the string, which may be
encoded as a database of relational tables. Manually
performing such transformations on a large collection
of strings is error prone and cumbersome, while
programmatic solutions are beyond the skill-set of
end-users. We present a programming by example
technology that allows end-users to automate such
repetitive tasks. We describe an expressive
transformation language for semantic manipulation that
combines table lookup operations and syntactic
manipulations. We then present a synthesis algorithm
that can learn all transformations in the language that
are consistent with the user-provided set of
input-output examples. We have implemented this
technology as an add-in for the Microsoft Excel
Spreadsheet system and have evaluated it successfully
over several benchmarks picked from various Excel
help-forums.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Liu:2012:CDD,
author = "Changbin Liu and Lu Ren and Boon Thau Loo and Yun Mao
and Prithwish Basu",
title = "{Cologne}: a declarative distributed constraint
optimization platform",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "8",
pages = "752--763",
month = apr,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Tue Nov 6 16:43:10 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "This paper presents Cologne, a declarative
optimization platform that enables constraint
optimization problems (COPs) to be declaratively
specified and incrementally executed in distributed
systems. Cologne integrates a declarative networking
engine with an off-the-shelf constraint solver. We have
developed the Colog language that combines distributed
Datalog used in declarative networking with language
constructs for specifying goals and constraints used in
COPs. Cologne uses novel query processing strategies
for processing Colog programs, by combining the use of
bottom-up distributed Datalog evaluation with top-down
goal-oriented constraint solving. Using case studies
based on cloud and wireless network optimizations, we
demonstrate that Cologne (1) can flexibly support a
wide range of policy-based optimizations in distributed
systems, (2) results in orders of magnitude less code
compared to imperative implementations, and (3) is
highly efficient with low overhead and fast convergence
times.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Zhang:2012:OBA,
author = "Yi Zhang and Jun Yang",
title = "Optimizing {I/O} for big array analytics",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "8",
pages = "764--775",
month = apr,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Tue Nov 6 16:43:10 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "Big array analytics is becoming indispensable in
answering important scientific and business questions.
Most analysis tasks consist of multiple steps, each
making one or multiple passes over the arrays to be
analyzed and generating intermediate results. In the
big data setting, I/O optimization is a key to
efficient analytics. In this paper, we develop a
framework and techniques for capturing a broad range of
analysis tasks expressible in nested-loop forms,
representing them in a declarative way, and optimizing
their I/O by identifying sharing opportunities.
Experiment results show that our optimizer is capable
of finding execution plans that exploit nontrivial I/O
sharing opportunities with significant savings.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Bailis:2012:PBS,
author = "Peter Bailis and Shivaram Venkataraman and Michael J.
Franklin and Joseph M. Hellerstein and Ion Stoica",
title = "Probabilistically bounded staleness for practical
partial quorums",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "8",
pages = "776--787",
month = apr,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Tue Nov 6 16:43:10 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "Data store replication results in a fundamental
trade-off between operation latency and data
consistency. In this paper, we examine this trade-off
in the context of quorum-replicated data stores. Under
partial, or non-strict quorum replication, a data store
waits for responses from a subset of replicas before
answering a query, without guaranteeing that read and
write replica sets intersect. As deployed in practice,
these configurations provide only basic eventual
consistency guarantees, with no limit to the recency of
data returned. However, anecdotally, partial quorums
are often ``good enough'' for practitioners given their
latency benefits. In this work, we explain why partial
quorums are regularly acceptable in practice, analyzing
both the staleness of data they return and the latency
benefits they offer. We introduce Probabilistically
Bounded Staleness (PBS) consistency, which provides
expected bounds on staleness with respect to both
versions and wall clock time. We derive a closed-form
solution for versioned staleness as well as model
real-time staleness for representative Dynamo-style
systems under internet-scale production workloads.
Using PBS, we measure the latency-consistency trade-off
for partial quorum systems. We quantitatively
demonstrate how eventually consistent systems
frequently return consistent data within tens of
milliseconds while offering significant latency
benefits.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Sun:2012:ESM,
author = "Zhao Sun and Hongzhi Wang and Haixun Wang and Bin Shao
and Jianzhong Li",
title = "Efficient subgraph matching on billion node graphs",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "9",
pages = "788--799",
month = may,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Tue Nov 6 16:43:11 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "The ability to handle large scale graph data is
crucial to an increasing number of applications. Much
work has been dedicated to supporting basic graph
operations such as subgraph matching, reachability,
regular expression matching, etc. In many cases, graph
indices are employed to speed up query processing.
Typically, most indices require either super-linear
indexing time or super-linear indexing space.
Unfortunately, for very large graphs, super-linear
approaches are almost always infeasible. In this paper,
we study the problem of subgraph matching on
billion-node graphs. We present a novel algorithm that
supports efficient subgraph matching for graphs
deployed on a distributed memory store. Instead of
relying on super-linear indices, we use efficient graph
exploration and massive parallel computing for query
processing. Our experimental results demonstrate the
feasibility of performing subgraph matching on
web-scale graph data.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Yuan:2012:ESS,
author = "Ye Yuan and Guoren Wang and Lei Chen and Haixun Wang",
title = "Efficient subgraph similarity search on large
probabilistic graph databases",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "9",
pages = "800--811",
month = may,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Tue Nov 6 16:43:11 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "Many studies have been conducted on seeking the
efficient solution for subgraph similarity search over
certain (deterministic) graphs due to its wide
application in many fields, including bioinformatics,
social network analysis, and Resource Description
Framework (RDF) data management. All these works assume
that the underlying data are certain. However, in
reality, graphs are often noisy and uncertain due to
various factors, such as errors in data extraction,
inconsistencies in data integration, and privacy
preserving purposes. Therefore, in this paper, we study
subgraph similarity search on large probabilistic graph
databases. Different from previous works assuming that
edges in an uncertain graph are independent of each
other, we study the uncertain graphs where edges'
occurrences are correlated. We formally prove that
subgraph similarity search over probabilistic graphs is
\#P-complete, thus, we employ a filter-and-verify
framework to speed up the search. In the filtering
phase, we develop tight lower and upper bounds of
subgraph similarity probability based on a
probabilistic matrix index, PMI. PMI is composed of
discriminative subgraph features associated with tight
lower and upper bounds of subgraph isomorphism
probability. Based on PMI, we can sort out a large
number of probabilistic graphs and maximize the pruning
capability. During the verification phase, we develop
an efficient sampling algorithm to validate the
remaining candidates. The efficiency of our proposed
solutions has been verified through extensive
experiments.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Wang:2012:TDM,
author = "Jia Wang and James Cheng",
title = "Truss decomposition in massive networks",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "9",
pages = "812--823",
month = may,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Tue Nov 6 16:43:11 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "The $k$-truss is a type of cohesive subgraphs proposed
recently for the study of networks. While the problem
of computing most cohesive subgraphs is NP-hard, there
exists a polynomial time algorithm for computing
$k$-truss. Compared with $k$-core which is also
efficient to compute, $k$-truss represents the ``core''
of a $k$-core that keeps the key information of, while
filtering out less important information from, the
$k$-core. However, existing algorithms for computing
$k$-truss are inefficient for handling today's massive
networks. We first improve the existing in-memory
algorithm for computing $k$-truss in networks of
moderate size. Then, we propose two I/O-efficient
algorithms to handle massive networks that cannot fit
in main memory. Our experiments on real datasets verify
the efficiency of our algorithms and the value of
$k$-truss.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Fan:2012:SST,
author = "Ju Fan and Guoliang Li and Lizhu Zhou and Shanshan
Chen and Jun Hu",
title = "{Seal}: spatio-textual similarity search",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "9",
pages = "824--835",
month = may,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Tue Nov 6 16:43:11 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "Location-based services (LBS) have become more and
more ubiquitous recently. Existing methods focus on
finding relevant points-of-interest (POIs) based on
users' locations and query keywords. Nowadays, modern
LBS applications generate a new kind of spatio-textual
data, regions-of-interest (ROIs), containing
region-based spatial information and textual
description, e.g., mobile user profiles with active
regions and interest tags. To satisfy search
requirements on ROIs, we study a new research problem,
called spatio-textual similarity search: Given a set of
ROIs and a query ROI, we find the similar ROIs by
considering spatial overlap and textual similarity.
Spatio-textual similarity search has many important
applications, e.g., social marketing in location-aware
social networks. It calls for an efficient search
method to support large scales of spatio-textual data
in LBS systems. To this end, we introduce a
filter-and-verification framework to compute the
answers. In the filter step, we generate signatures for
the ROIs and the query, and utilize the signatures to
generate candidates whose signatures are similar to
that of the query. In the verification step, we verify
the candidates and identify the final answers. To
achieve high performance, we generate effective
high-quality signatures, and devise efficient filtering
algorithms as well as pruning techniques. Experimental
results on real and synthetic datasets show that our
method achieves high performance.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Lappas:2012:SBT,
author = "Theodoros Lappas and Marcos R. Vieira and Dimitrios
Gunopulos and Vassilis J. Tsotras",
title = "On the spatiotemporal burstiness of terms",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "9",
pages = "836--847",
month = may,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Tue Nov 6 16:43:11 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "Thousands of documents are made available to the users
via the web on a daily basis. One of the most
extensively studied problems in the context of such
document streams is burst identification. Given a term
t, a burst is generally exhibited when an unusually
high frequency is observed for t. While spatial and
temporal burstiness have been studied individually in
the past, our work is the first to simultaneously track
and measure spatiotemporal term burstiness. In
addition, we use the mined burstiness information
toward an efficient document-search engine: given a
user's query of terms, our engine returns a ranked list
of documents discussing influential events with a
strong spatiotemporal impact. We demonstrate the
efficiency of our methods with an extensive
experimental evaluation on real and synthetic
datasets.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Shirani-Mehr:2012:ERQ,
author = "Houtan Shirani-Mehr and Farnoush Banaei-Kashani and
Cyrus Shahabi",
title = "Efficient reachability query evaluation in large
spatiotemporal contact datasets",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "9",
pages = "848--859",
month = may,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Tue Nov 6 16:43:11 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "With the advent of reliable positioning technologies
and prevalence of location-based services, it is now
feasible to accurately study the propagation of items
such as infectious viruses, sensitive information
pieces, and malwares through a population of moving
objects, e.g., individuals, mobile devices, and
vehicles. In such application scenarios, an item passes
between two objects when the objects are sufficiently
close (i.e., when they are, so-called, in contact), and
hence once an item is initiated, it can penetrate the
object population through the evolving network of
contacts among objects, termed contact network. In this
paper, for the first time we define and study
reachability queries in large (i.e., disk-resident)
contact datasets which record the movement of a
(potentially large) set of objects moving in a spatial
environment over an extended time period. A
reachability query verifies whether two objects are
``reachable'' through the evolving contact network
represented by such contact datasets. We propose two
contact-dataset indexes that enable efficient
evaluation of such queries despite the potentially
humongous size of the contact datasets. With the first
index, termed ReachGrid, at the query time only a small
necessary portion of the contact network which is
required for reachability evaluation is constructed and
traversed. With the second approach, termed ReachGraph,
we precompute reachability at different scales and
leverage these precalculations at the query time for
efficient query processing. We optimize the placement
of both indexes on disk to enable efficient index
traversal during query processing. We study the pros
and cons of our proposed approaches by performing
extensive experiments with both real and synthetic
data. Based on our experimental results, our proposed
approaches outperform existing reachability query
processing techniques in contact networks by 76\% on
average.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Nguyen:2012:BMO,
author = "Thi Nguyen and Zhen He and Rui Zhang and Phillip
Ward",
title = "Boosting moving object indexing through velocity
partitioning",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "9",
pages = "860--871",
month = may,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Tue Nov 6 16:43:11 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "There have been intense research interests in moving
object indexing in the past decade. However, existing
work did not exploit the important property of skewed
velocity distributions. In many real world scenarios,
objects travel predominantly along only a few
directions. Examples include vehicles on road networks,
flights, people walking on the streets, etc. The search
space for a query is heavily dependent on the velocity
distribution of the objects grouped in the nodes of an
index tree. Motivated by this observation, we propose
the velocity partitioning (VP) technique, which
exploits the skew in velocity distribution to speed up
query processing using moving object indexes. The VP
technique first identifies the ``dominant velocity axes
(DVAs)'' using a combination of principal components
analysis (PCA) and $k$-means clustering. Then, a moving
object index (e.g., a TPR-tree) is created based on
each DVA, using the DVA as an axis of the underlying
coordinate system. An object is maintained in the index
whose DVA is closest to the object's current moving
direction. Thus, all the objects in an index are moving
in a near 1-dimensional space instead of a
2-dimensional space. As a result, the expansion of the
search space with time is greatly reduced, from a
quadratic function of the maximum speed (of the objects
in the search range) to a near linear function of the
maximum speed. The VP technique can be applied to a
wide range of moving object index structures. We have
implemented the VP technique on two representative
ones, the TPR*-tree and the B$^x$-tree. Extensive
experiments validate that the VP technique consistently
improves the performance of those index structures.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Bidoit-Tollu:2012:TBD,
author = "Nicole Bidoit-Tollu and Dario Colazzo and Federico
Ulliana",
title = "Type-based detection of {XML} query-update
independence",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "9",
pages = "872--883",
month = may,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Tue Nov 6 16:43:11 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "This paper presents a novel static analysis technique
to detect XML query-update independence, in the
presence of a schema. Rather than types, our system
infers chains of types. Each chain represents a path
that can be traversed on a valid document during
query/update evaluation. The resulting independence
analysis is precise, although it raises a challenging
issue: recursive schemas may lead to inference of
infinitely many chains. A sound and complete
approximation technique ensuring a finite analysis in
any case is presented, together with an efficient
implementation performing the chain-based analysis in
polynomial space and time.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Sowell:2012:MSD,
author = "Benjamin Sowell and Wojciech Golab and Mehul A. Shah",
title = "{Minuet}: a scalable distributed multiversion
{B}-tree",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "9",
pages = "884--895",
month = may,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Tue Nov 6 16:43:11 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "Data management systems have traditionally been
designed to support either long-running analytics
queries or short-lived transactions, but an increasing
number of applications need both. For example, online
games, socio-mobile apps, and e-commerce sites need to
not only maintain operational state, but also analyze
that data quickly to make predictions and
recommendations that improve user experience. In this
paper, we present Minuet, a distributed, main-memory
B-tree that supports both transactions and
copy-on-write snapshots for in-situ analytics. Minuet
uses main-memory storage to enable low-latency
transactional operations as well as analytics queries
without compromising transaction performance. In
addition to supporting read-only analytics queries on
snapshots, Minuet supports writable clones, so that
users can create branching versions of the data. This
feature can be quite useful, e.g. to support complex
``what-if'' analysis or to facilitate wide-area
replication. Our experiments show that Minuet
outperforms a commercial main-memory database in many
ways. It scales to hundreds of cores and TBs of memory,
and can process hundreds of thousands of B-tree
operations per second while executing long-running
scans.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Yin:2012:CLT,
author = "Hongzhi Yin and Bin Cui and Jing Li and Junjie Yao and
Chen Chen",
title = "Challenging the long tail recommendation",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "9",
pages = "896--907",
month = may,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Tue Nov 6 16:43:11 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "The success of ``infinite-inventory'' retailers such
as Amazon.com and Netflix has been largely attributed
to a ``long tail'' phenomenon. Although the majority of
their inventory is not in high demand, these niche
products, unavailable at limited-inventory competitors,
generate a significant fraction of total revenue in
aggregate. In addition, tail product availability can
boost head sales by offering consumers the convenience
of ``one-stop shopping'' for both their mainstream and
niche tastes. However, most of existing recommender
systems, especially collaborative filter based methods,
can not recommend tail products due to the data
sparsity issue. It has been widely acknowledged that to
recommend popular products is easier yet more trivial
while to recommend long tail products adds more novelty
yet it is also a more challenging task. In this paper,
we propose a novel suite of graph-based algorithms for
the long tail recommendation. We first represent
user-item information with undirected edge-weighted
graph and investigate the theoretical foundation of
applying Hitting Time algorithm for long tail item
recommendation. To improve recommendation diversity and
accuracy, we extend Hitting Time and propose efficient
Absorbing Time algorithm to help users find their
favorite long tail items. Finally, we refine the
Absorbing Time algorithm and propose two entropy-biased
Absorbing Cost algorithms to distinguish the variation
on different user-item rating pairs, which further
enhances the effectiveness of long tail recommendation.
Empirical experiments on two real life datasets show
that our proposed algorithms are effective to recommend
long tail items and outperform state-of-the-art
recommendation techniques.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Pimplikar:2012:ATQ,
author = "Rakesh Pimplikar and Sunita Sarawagi",
title = "Answering table queries on the {Web} using column
keywords",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "10",
pages = "908--919",
month = jun,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Tue Nov 6 16:43:13 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "We present the design of a structured search engine
which returns a multi-column table in response to a
query consisting of keywords describing each of its
columns. We answer such queries by exploiting the
millions of tables on the Web because these are much
richer sources of structured knowledge than free-format
text. However, a corpus of tables harvested from
arbitrary HTML web pages presents huge challenges of
diversity and redundancy not seen in centrally edited
knowledge bases. We concentrate on one concrete task in
this paper. Given a set of Web tables T$_1$,\ldots{},
T$_n$, and a query Q with q sets of keywords
Q$_1$,\ldots{}, Q$_q$, decide for each T$_i$ if it is
relevant to Q and if so, identify the mapping between
the columns of T$_i$ and query columns. We represent
this task as a graphical model that jointly maps all
tables by incorporating diverse sources of clues
spanning matches in different parts of the table,
corpus-wide co-occurrence statistics, and content
overlap across table columns. We define a novel query
segmentation model for matching keywords to table
columns, and a robust mechanism of exploiting content
overlap across table columns. We design efficient
inference algorithms based on bipartite matching and
constrained graph cuts to solve the joint labeling
task. Experiments on a workload of 59 queries over a 25
million web table corpus shows significant boost in
accuracy over baseline IR methods.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Goodrich:2012:EVW,
author = "Michael T. Goodrich and Charalampos Papamanthou and
Duy Nguyen and Roberto Tamassia and Cristina Videira
Lopes and Olga Ohrimenko and Nikos Triandopoulos",
title = "Efficient verification of web-content searching
through authenticated web crawlers",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "10",
pages = "920--931",
month = jun,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Tue Nov 6 16:43:13 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "We consider the problem of verifying the correctness
and completeness of the result of a keyword search. We
introduce the concept of an authenticated web crawler
and present its design and prototype implementation. An
authenticated web crawler is a trusted program that
computes a specially-crafted signature over the web
contents it visits. This signature enables (i) the
verification of common Internet queries on web pages,
such as conjunctive keyword searches---this guarantees
that the output of a conjunctive keyword search is
correct and complete; (ii) the verification of the
content returned by such Internet queries---this
guarantees that web data is authentic and has not been
maliciously altered since the computation of the
signature by the crawler. In our solution, the search
engine returns a cryptographic proof of the query
result. Both the proof size and the verification time
are proportional only to the sizes of the query
description and the query result, but do not depend on
the number or sizes of the web pages over which the
search is performed. As we experimentally demonstrate,
the prototype implementation of our system provides a
low communication overhead between the search engine
and the user, and fast verification of the returned
results by the user.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Blunschi:2012:SGS,
author = "Lukas Blunschi and Claudio Jossen and Donald Kossmann
and Magdalini Mori and Kurt Stockinger",
title = "{SODA}: generating {SQL} for business users",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "10",
pages = "932--943",
month = jun,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Tue Nov 6 16:43:13 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "The purpose of data warehouses is to enable business
analysts to make better decisions. Over the years the
technology has matured and data warehouses have become
extremely successful. As a consequence, more and more
data has been added to the data warehouses and their
schemas have become increasingly complex. These systems
still work great in order to generate pre-canned
reports. However, with their current complexity, they
tend to be a poor match for non tech-savvy business
analysts who need answers to ad-hoc queries that were
not anticipated. This paper describes the design,
implementation, and experience of the SODA system
(Search over DAta Warehouse). SODA bridges the gap
between the business needs of analysts and the
technical complexity of current data warehouses. SODA
enables a Google-like search experience for data
warehouses by taking keyword queries of business users
and automatically generating executable SQL. The key
idea is to use a graph pattern matching algorithm that
uses the metadata model of the data warehouse. Our
results with real data from a global player in the
financial services industry show that SODA produces
queries with high precision and recall, and makes it
much easier for business users to interactively explore
highly-complex data warehouses.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Terrovitis:2012:PPD,
author = "Manolis Terrovitis and Nikos Mamoulis and John
Liagouris and Spiros Skiadopoulos",
title = "Privacy preservation by disassociation",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "10",
pages = "944--955",
month = jun,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Tue Nov 6 16:43:13 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "In this work, we focus on protection against identity
disclosure in the publication of sparse
multidimensional data. Existing multidimensional
anonymization techniques (a) protect the privacy of
users either by altering the set of quasi-identifiers
of the original data (e.g., by generalization or
suppression) or by adding noise (e.g., using
differential privacy) and/or (b) assume a clear
distinction between sensitive and non-sensitive
information and sever the possible linkage. In many
real world applications the above techniques are not
applicable. For instance, consider web search query
logs. Suppressing or generalizing anonymization methods
would remove the most valuable information in the
dataset: the original query terms. Additionally, web
search query logs contain millions of query terms which
cannot be categorized as sensitive or non-sensitive
since a term may be sensitive for a user and
non-sensitive for another. Motivated by this
observation, we propose an anonymization technique
termed disassociation that preserves the original terms
but hides the fact that two or more different terms
appear in the same record. We protect the users'
privacy by disassociating record terms that participate
in identifying combinations. This way the adversary
cannot associate with high probability a record with a
rare combination of terms. To the best of our
knowledge, our proposal is the first to employ such a
technique to provide protection against identity
disclosure. We propose an anonymization algorithm based
on our approach and evaluate its performance on real
and synthetic datasets, comparing it against other
state-of-the-art methods based on generalization and
differential privacy.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Kanagal:2012:SRS,
author = "Bhargav Kanagal and Amr Ahmed and Sandeep Pandey and
Vanja Josifovski and Jeff Yuan and Lluis Garcia-Pueyo",
title = "Supercharging recommender systems using taxonomies for
learning user purchase behavior",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "10",
pages = "956--967",
month = jun,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Tue Nov 6 16:43:13 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "Recommender systems based on latent factor models have
been effectively used for understanding user interests
and predicting future actions. Such models work by
projecting the users and items into a smaller
dimensional space, thereby clustering similar users and
items together and subsequently compute similarity
between unknown user-item pairs. When user-item
interactions are sparse (sparsity problem) or when new
items continuously appear (cold start problem), these
models perform poorly. In this paper, we exploit the
combination of taxonomies and latent factor models to
mitigate these issues and improve recommendation
accuracy. We observe that taxonomies provide structure
similar to that of a latent factor model: namely, it
imposes human-labeled categories (clusters) over items.
This leads to our proposed taxonomy-aware latent factor
model (TF) which combines taxonomies and latent factors
using additive models. We develop efficient algorithms
to train the TF models, which scales to large number of
users/items and develop scalable
inference/recommendation algorithms by exploiting the
structure of the taxonomy. In addition, we extend the
TF model to account for the temporal dynamics of user
interests using high-order Markov chains. To deal with
large-scale data, we develop a parallel multi-core
implementation of our TF model. We empirically evaluate
the TF model for the task of predicting user purchases
using a real-world shopping dataset spanning more than
a million users and products. Our experiments
demonstrate the benefits of using our TF models over
existing approaches, in terms of both prediction
accuracy and running time.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Ahmad:2012:DHO,
author = "Yanif Ahmad and Oliver Kennedy and Christoph Koch and
Milos Nikolic",
title = "{DBToaster}: higher-order delta processing for
dynamic, frequently fresh views",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "10",
pages = "968--979",
month = jun,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Tue Nov 6 16:43:13 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "Applications ranging from algorithmic trading to
scientific data analysis require realtime analytics
based on views over databases that change at very high
rates. Such views have to be kept fresh at low
maintenance cost and latencies. At the same time, these
views have to support classical SQL, rather than window
semantics, to enable applications that combine current
with aged or historical data. In this paper, we present
viewlet transforms, a recursive finite differencing
technique applied to queries. The viewlet transform
materializes a query and a set of its higher-order
deltas as views. These views support each other's
incremental maintenance, leading to a reduced overall
view maintenance cost. The viewlet transform of a query
admits efficient evaluation, the elimination of certain
expensive query operations, and aggressive
parallelization. We develop viewlet transforms into a
workable query execution technique, present a heuristic
and cost-based optimization framework, and report on
experiments with a prototype dynamic data management
system that combines viewlet transforms with an
optimizing compilation technique. The system supports
tens of thousands of complete view refreshes a second
for a wide range of queries.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Agarwal:2012:RTD,
author = "Manoj K. Agarwal and Krithi Ramamritham and Manish
Bhide",
title = "Real time discovery of dense clusters in highly
dynamic graphs: identifying real world events in highly
dynamic environments",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "10",
pages = "980--991",
month = jun,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Tue Nov 6 16:43:13 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "Due to their real time nature, microblog streams are a
rich source of dynamic information, for example, about
emerging events. Existing techniques for discovering
such events from a microblog stream in real time (such
as Twitter trending topics), have several lacunae when
used for discovering emerging events; extant graph
based event detection techniques are not practical in
microblog settings due to their complexity; and
conventional techniques, which have been developed for
blogs, web-pages, etc., involving the use of keyword
search, are only useful for finding information about
known events. Hence, in this paper, we present
techniques to discover events that are unraveling in
microblog message streams in real time so that such
events can be reported as soon as they occur. We model
the problem as discovering dense clusters in highly
dynamic graphs. Despite many recent advances in graph
analysis, ours is the first technique to identify dense
clusters in massive and highly dynamic graphs in real
time. Given the characteristics of microblog streams,
in order to find clusters without missing any events,
we propose and exploit a novel graph property which we
call short-cycle property. Our algorithms find these
clusters efficiently in spite of rapid changes to the
microblog streams. Further we present a novel ranking
function to identify the important events. Besides
proving the correctness of our algorithms we show their
practical utility by evaluating them using real world
microblog data. These demonstrate our technique's
ability to discover, with high precision and recall,
emerging events in high intensity data streams in real
time. Many recent web applications create data which
can be represented as massive dynamic graphs. Our
technique can be easily extended to discover, in real
time, interesting patterns in such graphs.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Papapetrou:2012:SBQ,
author = "Odysseas Papapetrou and Minos Garofalakis and Antonios
Deligiannakis",
title = "Sketch-based querying of distributed sliding-window
data streams",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "10",
pages = "992--1003",
month = jun,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Tue Nov 6 16:43:13 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "While traditional data-management systems focus on
evaluating single, ad-hoc queries over static data sets
in a centralized setting, several emerging applications
require (possibly, continuous) answers to queries on
dynamic data that is widely distributed and constantly
updated. Furthermore, such query answers often need to
discount data that is ``stale'', and operate solely on
a sliding window of recent data arrivals (e.g., data
updates occurring over the last 24 hours). Such
distributed data streaming applications mandate novel
algorithmic solutions that are both time- and
space-efficient (to manage high-speed data streams),
and also communication-efficient (to deal with physical
data distribution). In this paper, we consider the
problem of complex query answering over distributed,
high-dimensional data streams in the sliding-window
model. We introduce a novel sketching technique (termed
ECM-sketch) that allows effective summarization of
streaming data over both time-based and count-based
sliding windows with probabilistic accuracy guarantees.
Our sketch structure enables point as well as
inner-product queries, and can be employed to address a
broad range of problems, such as maintaining frequency
statistics, finding heavy hitters, and computing
quantiles in the sliding-window model. Focusing on
distributed environments, we demonstrate how
ECM-sketches of individual, local streams can be
composed to generate a (low-error) ECM-sketch summary
of the order-preserving aggregation of all streams;
furthermore, we show how ECM-sketches can be exploited
for continuous monitoring of sliding-window queries
over distributed streams. Our extensive experimental
study with two real-life data sets validates our
theoretical claims and verifies the effectiveness of
our techniques. To the best of our knowledge, ours is
the first work to address efficient, guaranteed-error
complex query answering over distributed data streams
in the sliding-window model.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Vo:2012:LSL,
author = "Hoang Tam Vo and Sheng Wang and Divyakant Agrawal and
Gang Chen and Beng Chin Ooi",
title = "{LogBase}: a scalable log-structured database system
in the cloud",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "10",
pages = "1004--1015",
month = jun,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Tue Nov 6 16:43:13 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "Numerous applications such as financial transactions
(e.g., stock trading) are write-heavy in nature. The
shift from reads to writes in web applications has also
been accelerating in recent years. Write-ahead-logging
is a common approach for providing recovery capability
while improving performance in most storage systems.
However, the separation of log and application data
incurs write overheads observed in write-heavy
environments and hence adversely affects the write
throughput and recovery time in the system. In this
paper, we introduce LogBase --- a scalable
log-structured database system that adopts log-only
storage for removing the write bottleneck and
supporting fast system recovery. It is designed to be
dynamically deployed on commodity clusters to take
advantage of elastic scaling property of cloud
environments. LogBase provides in-memory multiversion
indexes for supporting efficient access to data
maintained in the log. LogBase also supports
transactions that bundle read and write operations
spanning across multiple records. We implemented the
proposed system and compared it with HBase and a
disk-based log-structured record-oriented system
modeled after RAMCloud. The experimental results show
that LogBase is able to provide sustained write
throughput, efficient data access out of the cache, and
effective system recovery.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Lu:2012:EPN,
author = "Wei Lu and Yanyan Shen and Su Chen and Beng Chin Ooi",
title = "Efficient processing of $k$ nearest neighbor joins
using {MapReduce}",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "10",
pages = "1016--1027",
month = jun,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Tue Nov 6 16:43:13 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "k nearest neighbor join ($k$ NN join), designed to
find $k$ nearest neighbors from a dataset S for every
object in another dataset R, is a primitive operation
widely adopted by many data mining applications. As a
combination of the $k$ nearest neighbor query and the
join operation, $k$ NN join is an expensive operation.
Given the increasing volume of data, it is difficult to
perform a $k$ NN join on a centralized machine
efficiently. In this paper, we investigate how to
perform $k$ NN join using MapReduce which is a
well-accepted framework for data-intensive applications
over clusters of computers. In brief, the mappers
cluster objects into groups; the reducers perform the
$k$ NN join on each group of objects separately. We
design an effective mapping mechanism that exploits
pruning rules for distance filtering, and hence reduces
both the shuffling and computational costs. To reduce
the shuffling cost, we propose two approximate
algorithms to minimize the number of replicas.
Extensive experiments on our in-house cluster
demonstrate that our proposed methods are efficient,
robust and scalable.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Laptev:2012:EAR,
author = "Nikolay Laptev and Kai Zeng and Carlo Zaniolo",
title = "Early accurate results for advanced analytics on
{MapReduce}",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "10",
pages = "1028--1039",
month = jun,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Tue Nov 6 16:43:13 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "Approximate results based on samples often provide the
only way in which advanced analytical applications on
very massive data sets can satisfy their time and
resource constraints. Unfortunately, methods and tools
for the computation of accurate early results are
currently not supported in MapReduce-oriented systems
although these are intended for 'big data'. Therefore,
we proposed and implemented a non-parametric extension
of Hadoop which allows the incremental computation of
early results for arbitrary work-flows, along with
reliable on-line estimates of the degree of accuracy
achieved so far in the computation. These estimates are
based on a technique called bootstrapping that has been
widely employed in statistics and can be applied to
arbitrary functions and data distributions. In this
paper, we describe our Early Accurate Result Library
(EARL) for Hadoop that was designed to minimize the
changes required to the MapReduce framework. Various
tests of EARL of Hadoop are presented to characterize
the frequent situations where EARL can provide major
speed-ups over the current version of Hadoop.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Liu:2012:CCD,
author = "Xuan Liu and Meiyu Lu and Beng Chin Ooi and Yanyan
Shen and Sai Wu and Meihui Zhang",
title = "{CDAS}: a crowdsourcing data analytics system",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "10",
pages = "1040--1051",
month = jun,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Tue Nov 6 16:43:13 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "Some complex problems, such as image tagging and
natural language processing, are very challenging for
computers, where even state-of-the-art technology is
yet able to provide satisfactory accuracy. Therefore,
rather than relying solely on developing new and better
algorithms to handle such tasks, we look to the
crowdsourcing solution --- employing human
participation --- to make good the shortfall in current
technology. Crowdsourcing is a good supplement to many
computer tasks. A complex job may be divided into
computer-oriented tasks and human-oriented tasks, which
are then assigned to machines and humans respectively.
To leverage the power of crowdsourcing, we design and
implement a Crowdsourcing Data Analytics System, CDAS.
CDAS is a framework designed to support the deployment
of various crowdsourcing applications. The core part of
CDAS is a quality-sensitive answering model, which
guides the crowdsourcing engine to process and monitor
the human tasks. In this paper, we introduce the
principles of our quality-sensitive model. To satisfy
user required accuracy, the model guides the
crowdsourcing query engine for the design and
processing of the corresponding crowdsourcing jobs. It
provides an estimated accuracy for each generated
result based on the human workers' historical
performances. When verifying the quality of the result,
the model employs an online strategy to reduce waiting
time. To show the effectiveness of the model, we
implement and deploy two analytics jobs on CDAS, a
twitter sentiment analytics job and an image tagging
job. We use real Twitter and Flickr data as our queries
respectively. We compare our approaches with
state-of-the-art classification and image annotation
techniques. The results show that the human-assisted
methods can indeed achieve a much higher accuracy. By
embedding the quality-sensitive model into
crowdsourcing query engine, we effectively reduce the
processing cost while maintaining the required query
answer quality.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Sachan:2012:MSS,
author = "Mayank Sachan and Arnab Bhattacharya",
title = "Mining statistically significant substrings using the
chi-square statistic",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "10",
pages = "1052--1063",
month = jun,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Tue Nov 6 16:43:13 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "The problem of identification of statistically
significant patterns in a sequence of data has been
applied to many domains such as intrusion detection
systems, financial models, web-click records, automated
monitoring systems, computational biology, cryptology,
and text analysis. An observed pattern of events is
deemed to be statistically significant if it is
unlikely to have occurred due to randomness or chance
alone. We use the chi-square statistic as a
quantitative measure of statistical significance. Given
a string of characters generated from a memoryless
Bernoulli model, the problem is to identify the
substring for which the empirical distribution of
single letters deviates the most from the distribution
expected from the generative Bernoulli model. This
deviation is captured using the chi-square measure. The
most significant substring (MSS) of a string is thus
defined as the substring having the highest chi-square
value. Till date, to the best of our knowledge, there
does not exist any algorithm to find the MSS in better
than $ O(n^2) $ time, where $n$ denotes the length of
the string. In this paper, we propose an algorithm to
find the most significant substring, whose running time
is $ O(n^{3 / 2})$ with high probability. We also study
some variants of this problem such as finding the
top-$t$ set, finding all substrings having chi-square
greater than a fixed threshold and finding the MSS
among substrings greater than a given length. We
experimentally demonstrate the asymptotic behavior of
the MSS on varying the string size and alphabet size.
We also describe some applications of our algorithm on
cryptology and real world data from finance and sports.
Finally, we compare our technique with the existing
heuristics for finding the MSS.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Albutiu:2012:MPS,
author = "Martina-Cezara Albutiu and Alfons Kemper and Thomas
Neumann",
title = "Massively parallel sort-merge joins in main memory
multi-core database systems",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "10",
pages = "1064--1075",
month = jun,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Tue Nov 6 16:43:13 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "Two emerging hardware trends will dominate the
database system technology in the near future:
increasing main memory capacities of several TB per
server and massively parallel multi-core processing.
Many algorithmic and control techniques in current
database technology were devised for disk-based systems
where I/O dominated the performance. In this work we
take a new look at the well-known sort-merge join
which, so far, has not been in the focus of research in
scalable massively parallel multi-core data processing
as it was deemed inferior to hash joins. We devise a
suite of new massively parallel sort-merge (MPSM) join
algorithms that are based on partial partition-based
sorting. Contrary to classical sort-merge joins, our
MPSM algorithms do not rely on a hard to parallelize
final merge step to create one complete sort order.
Rather they work on the independently created runs in
parallel. This way our MPSM algorithms are NUMA-affine
as all the sorting is carried out on local memory
partitions. An extensive experimental evaluation on a
modern 32-core machine with one TB of main memory
proves the competitive performance of MPSM on large
main memory databases with billions of objects. It
scales (almost) linearly in the number of employed
cores and clearly outperforms competing hash join
proposals --- in particular it outperforms the
``cutting-edge'' Vectorwise parallel query engine by a
factor of four.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Luo:2012:HDH,
author = "Tian Luo and Rubao Lee and Michael Mesnier and Feng
Chen and Xiaodong Zhang",
title = "{hStorage-DB}: heterogeneity-aware data management to
exploit the full capability of hybrid storage systems",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "10",
pages = "1076--1087",
month = jun,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Tue Nov 6 16:43:13 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "As storage systems become increasingly heterogeneous
and complex, it adds burdens on DBAs, causing
suboptimal performance even after a lot of human
efforts have been made. In addition, existing
monitoring-based storage management by access pattern
detections has difficulties to handle workloads that
are highly dynamic and concurrent. To achieve high
performance by best utilizing heterogeneous storage
devices, we have designed and implemented a
heterogeneity-aware software framework for DBMS storage
management called hStorage-DB, where semantic
information that is critical for storage I/O is
identified and passed to the storage manager. According
to the collected semantic information, requests are
classified into different types. Each type is assigned
a proper QoS policy supported by the underlying storage
system, so that every request will be served with a
suitable storage device. With hStorage-DB, we can well
utilize semantic information that cannot be detected
through data access monitoring but is particularly
important for a hybrid storage system. To show the
effectiveness of hStorage-DB, we have implemented a
system prototype that consists of an I/O request
classification enabled DBMS, and a hybrid storage
system that is organized into a two-level caching
hierarchy. Our performance evaluation shows that
hStorage-DB can automatically make proper decisions for
data allocation in different storage devices and make
substantial performance improvements in a
cost-efficient way.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Choi:2012:SAM,
author = "Dong-Wan Choi and Chin-Wan Chung and Yufei Tao",
title = "A scalable algorithm for maximizing range sum in
spatial databases",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "11",
pages = "1088--1099",
month = jul,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Tue Nov 6 16:43:15 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "This paper investigates the MaxRS problem in spatial
databases. Given a set O of weighted points and a
rectangular region r of a given size, the goal of the
MaxRS problem is to find a location of r such that the
sum of the weights of all the points covered by r is
maximized. This problem is useful in many
location-based applications such as finding the best
place for a new franchise store with a limited delivery
range and finding the most attractive place for a
tourist with a limited reachable range. However, the
problem has been studied mainly in theory,
particularly, in computational geometry. The existing
algorithms from the computational geometry community
are in-memory algorithms which do not guarantee the
scalability. In this paper, we propose a scalable
external-memory algorithm (ExactMaxRS) for the MaxRS
problem, which is optimal in terms of the I/O
complexity. Furthermore, we propose an approximation
algorithm (ApproxMaxCRS) for the MaxCRS problem that is
a circle version of the MaxRS problem. We prove the
correctness and optimality of the ExactMaxRS algorithm
along with the approximation bound of the ApproxMaxCRS
algorithm. From extensive experimental results, we show
that the ExactMaxRS algorithm is two orders of
magnitude faster than methods adapted from existing
algorithms, and the approximation bound in practice is
much better than the theoretical bound of the
ApproxMaxCRS algorithm.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Aly:2012:SQT,
author = "Ahmed M. Aly and Walid G. Aref and Mourad Ouzzani",
title = "Spatial queries with two {kNN} predicates",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "11",
pages = "1100--1111",
month = jul,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Tue Nov 6 16:43:15 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "The widespread use of location-aware devices has led
to countless location-based services in which a user
query can be arbitrarily complex, i.e., one that embeds
multiple spatial selection and join predicates. Amongst
these predicates, the $k$-Nearest-Neighbor ($k$ NN)
predicate stands as one of the most important and
widely used predicates. Unlike related research, this
paper goes beyond the optimization of queries with
single $k$ NN predicates, and shows how queries with
two $k$ NN predicates can be optimized. In particular,
the paper addresses the optimization of queries with:
(i) two $k$ NN-select predicates, (ii) two $k$ NN-join
predicates, and (iii) one $k$ NN-join predicate and one
$k$ NN-select predicate. For each type of queries,
conceptually correct query evaluation plans (QEPs) and
new algorithms that optimize the query execution time
are presented. Experimental results demonstrate that
the proposed algorithms outperform the conceptually
correct QEPs by orders of magnitude.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Sheng:2012:OAC,
author = "Cheng Sheng and Nan Zhang and Yufei Tao and Xin Jin",
title = "Optimal algorithms for crawling a hidden database in
the web",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "11",
pages = "1112--1123",
month = jul,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Tue Nov 6 16:43:15 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "A hidden database refers to a dataset that an
organization makes accessible on the web by allowing
users to issue queries through a search interface. In
other words, data acquisition from such a source is not
by following static hyper-links. Instead, data are
obtained by querying the interface, and reading the
result page dynamically generated. This, with other
facts such as the interface may answer a query only
partially, has prevented hidden databases from being
crawled effectively by existing search engines. This
paper remedies the problem by giving algorithms to
extract all the tuples from a hidden database. Our
algorithms are provably efficient, namely, they
accomplish the task by performing only a small number
of queries, even in the worst case. We also establish
theoretical results indicating that these algorithms
are asymptotically optimal --- i.e., it is impossible
to improve their efficiency by more than a constant
factor. The derivation of our upper and lower bound
results reveals significant insight into the
characteristics of the underlying problem. Extensive
experiments confirm the proposed techniques work very
well on all the real datasets examined.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Qin:2012:DTR,
author = "Lu Qin and Jeffrey Xu Yu and Lijun Chang",
title = "Diversifying top-$k$ results",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "11",
pages = "1124--1135",
month = jul,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Tue Nov 6 16:43:15 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "Top-$k$ query processing finds a list of $k$ results
that have largest scores w.r.t the user given query,
with the assumption that all the $k$ results are
independent to each other. In practice, some of the
top-$k$ results returned can be very similar to each
other. As a result some of the top-$k$ results returned
are redundant. In the literature, diversified top-$k$
search has been studied to return $k$ results that take
both score and diversity into consideration. Most
existing solutions on diversified top-$k$ search assume
that scores of all the search results are given, and
some works solve the diversity problem on a specific
problem and can hardly be extended to general cases. In
this paper, we study the diversified top-$k$ search
problem. We define a general diversified top-$k$ search
problem that only considers the similarity of the
search results themselves. We propose a framework, such
that most existing solutions for top-$k$ query
processing can be extended easily to handle diversified
top-$k$ search, by simply applying three new functions,
a sufficient stop condition sufficient(), a necessary
stop condition necessary(), and an algorithm for
diversified top-$k$ search on the current set of
generated results, div-search-current(). We propose
three new algorithms, namely, div-astar, div-dp, and
div-cut to solve the div-search-current() problem.
div-astar is an A* based algorithm, div-dp is an
algorithm that decomposes the results into components
which are searched using div-astar independently and
combined using dynamic programming. div-cut further
decomposes the current set of generated results using
cut points and combines the results using sophisticated
operations. We conducted extensive performance studies
using two real datasets, enwiki and reuters. Our
div-cut algorithm finds the optimal solution for
diversified top-$k$ search problem in seconds even for
$k$ as large as 2, 000.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Cao:2012:KAO,
author = "Xin Cao and Lisi Chen and Gao Cong and Xiaokui Xiao",
title = "Keyword-aware optimal route search",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "11",
pages = "1136--1147",
month = jul,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Tue Nov 6 16:43:15 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "Identifying a preferable route is an important problem
that finds applications in map services. When a user
plans a trip within a city, the user may want to find
``a most popular route such that it passes by shopping
mall, restaurant, and pub, and the travel time to and
from his hotel is within 4 hours.'' However, none of
the algorithms in the existing work on route planning
can be used to answer such queries. Motivated by this,
we define the problem of keyword-aware optimal route
query, denoted by KOR, which is to find an optimal
route such that it covers a set of user-specified
keywords, a specified budget constraint is satisfied,
and an objective score of the route is optimal. The
problem of answering KOR queries is NP-hard. We devise
an approximation algorithm OSScaling with provable
approximation bounds. Based on this algorithm, another
more efficient approximation algorithm BucketBound is
proposed. We also design a greedy approximation
algorithm. Results of empirical studies show that all
the proposed algorithms are capable of answering KOR
queries efficiently, while the BucketBound and Greedy
algorithms run faster. The empirical studies also offer
insight into the accuracy of the proposed algorithms.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Cautis:2012:AQU,
author = "Bogdan Cautis and Evgeny Kharlamov",
title = "Answering queries using views over probabilistic
{XML}: complexity and tractability",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "11",
pages = "1148--1159",
month = jul,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Tue Nov 6 16:43:15 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "We study the complexity of query answering using views
in a probabilistic XML setting, identifying large
classes of XPath queries --- with child and descendant
navigation and predicates --- for which there are
efficient (PTime) algorithms. We consider this problem
under the two possible semantics for XML query results:
with persistent node identifiers and in their absence.
Accordingly, we consider rewritings that can exploit a
single view, by means of compensation, and rewritings
that can use multiple views, by means of intersection.
Since in a probabilistic setting queries return answers
with probabilities, the problem of rewriting goes
beyond the classic one of retrieving XML answers from
views. For both semantics of XML queries, we show that,
even when XML answers can be retrieved from views,
their probabilities may not be computable. For
rewritings that use only compensation, we describe a
PTime decision procedure, based on easily verifiable
criteria that distinguish between the feasible cases
--- when probabilistic XML results are computable ---
and the unfeasible ones. For rewritings that can use
multiple views, with compensation and intersection, we
identify the most permissive conditions that make
probabilistic rewriting feasible, and we describe an
algorithm that is sound in general, and becomes
complete under fairly permissive restrictions, running
in PTime modulo worst-case exponential time equivalence
tests. This is the best we can hope for since
intersection makes query equivalence intractable
already over deterministic data. Our algorithm runs in
PTime whenever deterministic rewritings can be found in
PTime.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Jha:2012:PDM,
author = "Abhay Jha and Dan Suciu",
title = "Probabilistic databases with {MarkoViews}",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "11",
pages = "1160--1171",
month = jul,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Tue Nov 6 16:43:15 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "Most of the work on query evaluation in probabilistic
databases has focused on the simple tuple-independent
data model, where tuples are independent random events.
Several efficient query evaluation techniques exists in
this setting, such as safe plans, algorithms based on
OBDDs, tree-decomposition and a variety of
approximation algorithms. However, complex data
analytics tasks often require complex correlations, and
query evaluation then is significantly more expensive,
or more restrictive. In this paper, we propose MVDB as
a framework both for representing complex correlations
and for efficient query evaluation. An MVDB specifies
correlations by views, called MarkoViews, on the
probabilistic relations and declaring the weights of
the view's outputs. An MVDB is a (very large) Markov
Logic Network. We make two sets of contributions.
First, we show that query evaluation on an MVDB is
equivalent to evaluating a Union of Conjunctive
Query(UCQ) over a tuple-independent database. The
translation is exact (thus allowing the techniques
developed for tuple independent databases to be carried
over to MVDB), yet it is novel and quite non-obvious
(some resulting probabilities may be negative!). This
translation in itself though may not lead to much gain
since the translated query gets complicated as we try
to capture more correlations. Our second contribution
is to propose a new query evaluation strategy that
exploits offline compilation to speed up online query
evaluation. Here we utilize and extend our prior work
on compilation of UCQ. We validate experimentally our
techniques on a large probabilistic database with
MarkoViews inferred from the DBLP data.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Mamouras:2012:CSC,
author = "Konstantinos Mamouras and Sigal Oren and Lior Seeman
and Lucja Kot and Johannes Gehrke",
title = "The complexity of social coordination",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "11",
pages = "1172--1183",
month = jul,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Tue Nov 6 16:43:15 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "Coordination is a challenging everyday task; just
think of the last time you organized a party or a
meeting involving several people. As a growing part of
our social and professional life goes online, an
opportunity for an improved coordination process
arises. Recently, Gupta et al. proposed entangled
queries as a declarative abstraction for data-driven
coordination, where the difficulty of the coordination
task is shifted from the user to the database.
Unfortunately, evaluating entangled queries is very
hard, and thus previous work considered only a
restricted class of queries that satisfy safety (the
coordination partners are fixed) and uniqueness (all
queries need to be satisfied). In this paper we
significantly extend the class of feasible entangled
queries beyond uniqueness and safety. First, we show
that we can simply drop uniqueness and still
efficiently evaluate a set of safe entangled queries.
Second, we show that as long as all users coordinate on
the same set of attributes, we can give an efficient
algorithm for coordination even if the set of queries
does not satisfy safety. In an experimental evaluation
we show that our algorithms are feasible for a wide
spectrum of coordination scenarios.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Zhang:2012:EMW,
author = "Xiaofei Zhang and Lei Chen and Min Wang",
title = "Efficient multi-way theta-join processing using
{MapReduce}",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "11",
pages = "1184--1195",
month = jul,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Tue Nov 6 16:43:15 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "Multi-way Theta-join queries are powerful in
describing complex relations and therefore widely
employed in real practices. However, existing solutions
from traditional distributed and parallel databases for
multi-way Theta-join queries cannot be easily extended
to fit a shared-nothing distributed computing paradigm,
which is proven to be able to support OLAP applications
over immense data volumes. In this work, we study the
problem of efficient processing of multi-way Theta-join
queries using MapReduce from a cost-effective
perspective. Although there have been some works using
the (key, value) pair-based programming model to
support join operations, efficient processing of
multi-way Theta-join queries has never been fully
explored. The substantial challenge lies in, given a
number of processing units (that can run Map or Reduce
tasks), mapping a multi-way Theta-join query to a
number of MapReduce jobs and having them executed in a
well scheduled sequence, such that the total processing
time span is minimized. Our solution mainly includes
two parts: (1) cost metrics for both single MapReduce
job and a number of MapReduce jobs executed in a
certain order; (2) the efficient execution of a
chain-typed Theta-join with only one MapReduce job.
Comparing with the query evaluation strategy proposed
in [23] and the widely adopted Pig Latin and Hive SQL
solutions, our method achieves significant improvement
of the join processing efficiency.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Lim:2012:STB,
author = "Harold Lim and Herodotos Herodotou and Shivnath Babu",
title = "{Stubby}: a transformation-based optimizer for
{MapReduce} workflows",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "11",
pages = "1196--1207",
month = jul,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Tue Nov 6 16:43:15 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "There is a growing trend of performing analysis on
large datasets using workflows composed of MapReduce
jobs connected through producer-consumer relationships
based on data. This trend has spurred the development
of a number of interfaces---ranging from program-based
to query-based interfaces---for generating MapReduce
workflows. Studies have shown that the gap in
performance can be quite large between optimized and
unoptimized workflows. However, automatic cost-based
optimization of MapReduce workflows remains a challenge
due to the multitude of interfaces, large size of the
execution plan space, and the frequent unavailability
of all types of information needed for optimization. We
introduce a comprehensive plan space for MapReduce
workflows generated by popular workflow generators. We
then propose Stubby, a cost-based optimizer that
searches selectively through the subspace of the full
plan space that can be enumerated correctly and costed
based on the information available in any given
setting. Stubby enumerates the plan space based on
plan-to-plan transformations and an efficient search
algorithm. Stubby is designed to be extensible to new
interfaces and new types of optimizations, which is a
desirable feature given how rapidly MapReduce systems
are evolving. Stubby's efficiency and effectiveness
have been evaluated using representative workflows from
many domains.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Bao:2012:LWV,
author = "Zhuowei Bao and Susan B. Davidson and Tova Milo",
title = "Labeling workflow views with fine-grained
dependencies",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "11",
pages = "1208--1219",
month = jul,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Tue Nov 6 16:43:15 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "This paper considers the problem of efficiently
answering reachability queries over views of provenance
graphs, derived from executions of workflows that may
include recursion. Such views include composite modules
and model fine-grained dependencies between module
inputs and outputs. A novel view-adaptive dynamic
labeling scheme is developed for efficient query
evaluation, in which view specifications are labeled
statically (i.e. as they are created) and data items
are labeled dynamically as they are produced during a
workflow execution. Although the combination of
fine-grained dependencies and recursive workflows
entail, in general, long (linear-size) data labels, we
show that for a large natural class of workflows and
views, labels are compact (logarithmic-size) and
reachability queries can be evaluated in constant time.
Experimental results demonstrate the benefit of this
approach over the state-of-the-art technique when
applied for labeling multiple views.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Szlichta:2012:FOD,
author = "Jaros{\l}aw Szlichta and Parke Godfrey and Jarek
Gryz",
title = "Fundamentals of order dependencies",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "11",
pages = "1220--1231",
month = jul,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Tue Nov 6 16:43:15 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "Dependencies have played a significant role in
database design for many years. They have also been
shown to be useful in query optimization. In this
paper, we discuss dependencies between
lexicographically ordered sets of tuples. We introduce
formally the concept of order dependency and present a
set of axioms (inference rules) for them. We show how
query rewrites based on these axioms can be used for
query optimization. We present several interesting
theorems that can be derived using the inference rules.
We prove that functional dependencies are subsumed by
order dependencies and that our set of axioms for order
dependencies is sound and complete.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Bakibayev:2012:FQE,
author = "Nurzhan Bakibayev and Dan Olteanu and Jakub
Z{\'a}vodn{\'y}",
title = "{FDB}: a query engine for factorised relational
databases",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "11",
pages = "1232--1243",
month = jul,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Tue Nov 6 16:43:15 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "Factorised databases are relational databases that use
compact factorised representations at the physical
layer to reduce data redundancy and boost query
performance. This paper introduces FDB, an in-memory
query engine for select-project-join queries on
factorised databases. Key components of FDB are novel
algorithms for query optimisation and evaluation that
exploit the succinctness brought by data factorisation.
Experiments show that for data sets with many-to-many
relationships FDB can outperform relational engines by
orders of magnitude.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Cao:2012:OAW,
author = "Yu Cao and Chee-Yong Chan and Jie Li and Kian-Lee
Tan",
title = "Optimization of analytic window functions",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "11",
pages = "1244--1255",
month = jul,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Tue Nov 6 16:43:15 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "Analytic functions represent the state-of-the-art way
of performing complex data analysis within a single SQL
statement. In particular, an important class of
analytic functions that has been frequently used in
commercial systems to support OLAP and decision support
applications is the class of window functions. A window
function returns for each input tuple a value derived
from applying a function over a window of neighboring
tuples. However, existing window function evaluation
approaches are based on a naive sorting scheme. In this
paper, we study the problem of optimizing the
evaluation of window functions. We propose several
efficient techniques, and identify optimization
opportunities that allow us to optimize the evaluation
of a set of window functions. We have integrated our
scheme into PostgreSQL. Our comprehensive experimental
study on the TPC-DS datasets as well as synthetic
datasets and queries demonstrate significant speedup
over existing approaches.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Hueske:2012:OBB,
author = "Fabian Hueske and Mathias Peters and Matthias J. Sax
and Astrid Rheinl{\"a}nder and Rico Bergmann and
Aljoscha Krettek and Kostas Tzoumas",
title = "Opening the black boxes in data flow optimization",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "11",
pages = "1256--1267",
month = jul,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Tue Nov 6 16:43:15 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "Many systems for big data analytics employ a data flow
abstraction to define parallel data processing tasks.
In this setting, custom operations expressed as
user-defined functions are very common. We address the
problem of performing data flow optimization at this
level of abstraction, where the semantics of operators
are not known. Traditionally, query optimization is
applied to queries with known algebraic semantics. In
this work, we find that a handful of properties, rather
than a full algebraic specification, suffice to
establish reordering conditions for data processing
operators. We show that these properties can be
accurately estimated for black box operators by
statically analyzing the general-purpose code of their
user-defined functions. We design and implement an
optimizer for parallel data flows that does not assume
knowledge of semantics or algebraic properties of
operators. Our evaluation confirms that the optimizer
can apply common rewritings such as selection
reordering, bushy join-order enumeration, and limited
forms of aggregation push-down, hence yielding similar
rewriting power as modern relational DBMS optimizers.
Moreover, it can optimize the operator order of
nonrelational data flows, a unique feature among
today's systems.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Ewen:2012:SFI,
author = "Stephan Ewen and Kostas Tzoumas and Moritz Kaufmann
and Volker Markl",
title = "Spinning fast iterative data flows",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "11",
pages = "1268--1279",
month = jul,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Tue Nov 6 16:43:15 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "Parallel dataflow systems are a central part of most
analytic pipelines for big data. The iterative nature
of many analysis and machine learning algorithms,
however, is still a challenge for current systems.
While certain types of bulk iterative algorithms are
supported by novel dataflow frameworks, these systems
cannot exploit computational dependencies present in
many algorithms, such as graph algorithms. As a result,
these algorithms are inefficiently executed and have
led to specialized systems based on other paradigms,
such as message passing or shared memory. We propose a
method to integrate incremental iterations, a form of
workset iterations, with parallel dataflows. After
showing how to integrate bulk iterations into a
dataflow system and its optimizer, we present an
extension to the programming model for incremental
iterations. The extension alleviates for the lack of
mutable state in dataflows and allows for exploiting
the sparse computational dependencies inherent in many
iterative algorithms. The evaluation of a prototypical
implementation shows that those aspects lead to up to
two orders of magnitude speedup in algorithm runtime,
when exploited. In our experiments, the improved
dataflow system is highly competitive with specialized
systems while maintaining a transparent and unified
dataflow abstraction.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Mihaylov:2012:RRD,
author = "Svilen R. Mihaylov and Zachary G. Ives and Sudipto
Guha",
title = "{REX}: recursive, delta-based data-centric
computation",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "11",
pages = "1280--1291",
month = jul,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Tue Nov 6 16:43:15 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "In today's Web and social network environments, query
workloads include ad hoc and OLAP queries, as well as
iterative algorithms that analyze data relationships
(e.g., link analysis, clustering, learning). Modern
DBMSs support ad hoc and OLAP queries, but most are not
robust enough to scale to large clusters. Conversely,
``cloud'' platforms like MapReduce execute chains of
batch tasks across clusters in a fault tolerant way,
but have too much overhead to support ad hoc queries.
Moreover, both classes of platform incur significant
overhead in executing iterative data analysis
algorithms. Most such iterative algorithms repeatedly
refine portions of their answers, until some
convergence criterion is reached. However, general
cloud platforms typically must reprocess all data in
each step. DBMSs that support recursive SQL are more
efficient in that they propagate only the changes in
each step --- but they still accumulate each
iteration's state, even if it is no longer useful.
User-defined functions are also typically harder to
write for DBMSs than for cloud platforms. We seek to
unify the strengths of both styles of platforms, with a
focus on supporting iterative computations in which
changes, in the form of deltas, are propagated from
iteration to iteration, and state is efficiently
updated in an extensible way. We present a programming
model oriented around deltas, describe how we execute
and optimize such programs in our REX runtime system,
and validate that our platform also handles failures
gracefully. We experimentally validate our techniques,
and show speedups over the competing methods ranging
from 2.5 to nearly 100 times.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Cheng:2012:KRW,
author = "James Cheng and Zechao Shang and Hong Cheng and Haixun
Wang and Jeffrey Xu Yu",
title = "{K}-reach: who is in your small world",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "11",
pages = "1292--1303",
month = jul,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Tue Nov 6 16:43:15 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "We study the problem of answering $k$-hop reachability
queries in a directed graph, i.e., whether there exists
a directed path of length k, from a source query vertex
to a target query vertex in the input graph. The
problem of $k$-hop reachability is a general problem of
the classic reachability (where $ k = \infty $).
Existing indexes for processing classic reachability
queries, as well as for processing shortest path
queries, are not applicable or not efficient for
processing $k$-hop reachability queries. We propose an
index for processing $k$-hop reachability queries,
which is simple in design and efficient to construct.
Our experimental results on a wide range of real
datasets show that our index is more efficient than the
state-of-the-art indexes even for processing classic
reachability queries, for which these indexes are
primarily designed. We also show that our index is
efficient in answering $k$-hop reachability queries.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Fan:2012:PGD,
author = "Wenfei Fan and Xin Wang and Yinghui Wu",
title = "Performance guarantees for distributed reachability
queries",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "11",
pages = "1304--1316",
month = jul,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Tue Nov 6 16:43:15 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "In the real world a graph is often fragmented and
distributed across different sites. This highlights the
need for evaluating queries on distributed graphs. This
paper proposes distributed evaluation algorithms for
three classes of queries: reachability for determining
whether one node can reach another, bounded
reachability for deciding whether there exists a path
of a bounded length between a pair of nodes, and
regular reachability for checking whether there exists
a path connecting two nodes such that the node labels
on the path form a string in a given regular
expression. We develop these algorithms based on
partial evaluation, to explore parallel computation.
When evaluating a query Q on a distributed graph G, we
show that these algorithms possess the following
performance guarantees, no matter how G is fragmented
and distributed: (1) each site is visited only once;
(2) the total network traffic is determined by the size
of Q and the fragmentation of G, independent of the
size of G; and (3) the response time is decided by the
largest fragment of G rather than the entire G. In
addition, we show that these algorithms can be readily
implemented in the MapReduce framework. Using synthetic
and real-life data, we experimentally verify that these
algorithms are scalable on large graphs, regardless of
how the graphs are distributed.",
acknowledgement = ack-nhfb,
ajournal = "Proc. VLDB Endowment",
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Chubak:2012:EIQ,
author = "Pirooz Chubak and Davood Rafiei",
title = "Efficient indexing and querying over syntactically
annotated trees",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "11",
pages = "1316--1327",
month = jul,
year = "2012",
CODEN = "????",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "
