Zobrazeno 1 - 10
of 41
pro vyhledávání: '"Christopher Olston"'
Autor:
Jennifer Widom, Michael J. Franklin, Michael Stonebraker, Volker Markl, Joseph M. Hellerstein, Samuel Madden, Anastasia Ailamaki, Johannes Gehrke, Daniel J. Abadi, Dan Suciu, Christopher Olston, Tova Milo, Philip A. Bernstein, Laura M. Haas, Rakesh Agrawal, Todd Walter, Christopher Ré, Donald Kossmann, Jeffrey Dean, Yannis Ioannidis, AnHai Doan, Jeffrey F. Naughton, Raghu Ramakrishnan, Magdalena Balazinska, Sharad Mehrotra, Michael J. Carey, H. V. Jagadish, Alon Halevy, Surajit Chaudhuri, Beng Chin Ooi
Publikováno v:
Communications of the ACM. 59:92-99
Every few years a group of database researchers meets to discuss the state of database research, its impact on practice, and important new directions. This report summarizes the discussion and conclusions of the eighth such meeting, held October 14-
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7ab7808d55c8df77b4d8c9a613a6aa41
https://doi.org/10.1145/2845915
https://doi.org/10.1145/2845915
Autor:
Alon Halevy, Neoklis Polyzotis, Flip Korn, Sudip Roy, Steven Euijong Whang, Natalya F. Noy, Christopher Olston
Publikováno v:
SIGMOD Conference
Enterprises increasingly rely on structured datasets to run their businesses. These datasets take a variety of forms, such as structured files, databases, spreadsheets, or even services that provide access to the data. The datasets often reside in di
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::07a1722c6e7936659bf5f8619363070e
https://doi.org/10.1145/2882903.2903730
https://doi.org/10.1145/2882903.2903730
Autor:
Marc Najork, Christopher Olston
Publikováno v:
Foundations and Trends® in Information Retrieval. 4:175-246
This is a survey of the science and practice of web crawling. While at first glance web crawling may appear to be merely an application of breadth-first-search, the truth is that there are many challenges ranging from systems concerns such as managin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ccbcfa045dff308587489c61c3167960
https://doi.org/10.1561/1500000017
https://doi.org/10.1561/1500000017
Autor:
Santhosh Srinivasan, Alan Gates, Christopher Olston, Benjamin Reed, Shravan Narayanamurthy, Olga Natkovich, Utkarsh Srivastava, Shubham Chopra, Pradeep Kamath
Publikováno v:
Proceedings of the VLDB Endowment. 2:1414-1425
Increasingly, organizations capture, transform and analyze enormous data sets. Prominent examples include internet companies and e-science. The Map-Reduce scalable dataflow paradigm has become popular for these applications. Its simple, explicit data
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::af262d29ad3b49d1eff053110bbd1bed
https://doi.org/10.14778/1687553.1687568
https://doi.org/10.14778/1687553.1687568
Publikováno v:
Proceedings of the VLDB Endowment. 1:958-969
We study how best to schedule scans of large data files, in the presence of many simultaneous requests to a common set of files. The objective is to maximize the overall rate of processing these files, by sharing scans of the same file as aggressivel
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::04b63080d3667eff62a5364ec85b3784
https://doi.org/10.14778/1453856.1453960
https://doi.org/10.14778/1453856.1453960
Autor:
Amit Manjhi, Bruce M. Maggs, Christopher Olston, Anthony Tomasic, Charles Garrod, Todd C. Mowry, Anastasia Ailamaki
Publikováno v:
Proceedings of the VLDB Endowment. 1:550-561
The backend database system is often the performance bottleneck when running web applications. A common approach to scale the database component is query result caching, but it faces the challenge of maintaining a high cache hit rate while efficientl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::abd9428cf0883a848e115c28857a1135
https://doi.org/10.14778/1453856.1453917
https://doi.org/10.14778/1453856.1453917
Autor:
Sergei Vassilvitskii, Andrew Tomkins, Ravi Kumar, Christopher Olston, Vanja Josifovski, Marcus Fontoura
Publikováno v:
Proceedings of the VLDB Endowment. 1:672-683
In this paper we propose a novel document retrieval model in which text queries are augmented with multi-dimensional taxonomy restrictions. These restrictions may be relaxed at a cost to result quality. This new model may be applicable in many arenas
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e70894709105ba82a1ab501166588d4e
https://doi.org/10.14778/1453856.1453930
https://doi.org/10.14778/1453856.1453930
Publikováno v:
Journal of Algorithms. 62:1-18
We consider the problem of estimating the length of the shortest path from a vertex s to a vertex t in a DAG whose edge lengths are known only approximately but can be determined exactly at a cost. Initially, for each edge e, the length of e is known
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::832a7d0b11089eeb0020cf5637265f41
https://doi.org/10.1016/j.jalgor.2004.07.005
https://doi.org/10.1016/j.jalgor.2004.07.005
Autor:
Ed H. Chi, Christopher Olston
Publikováno v:
ACM Transactions on Computer-Human Interaction. 10:177-197
The two predominant paradigms for finding information on the Web are browsing and keyword searching. While they exhibit complementary advantages, neither paradigm alone is adequate for complex information goals that lend themselves partially to brows
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6cb701fa63a008d205cb9f5612523d2f
https://doi.org/10.1145/937549.937550
https://doi.org/10.1145/937549.937550
Publikováno v:
STOC
We consider a new model for computing with uncertainty. It is desired to compute a function f(X1,. . .,Xn), where X1, . . ., Xn are unknown but guaranteed to lie in specified intervals I1, . . ., In. It is possible to query the precise value of any X
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::30da2b659f75d2808e4bf39ec9bfcaef
https://doi.org/10.1137/s0097539701395668
https://doi.org/10.1137/s0097539701395668