Sciweavers

10625 search results - page 1814 / 2125
» Supporting delay-intolerant applications
Sort
View
SIGMOD
2009
ACM
175views Database» more  SIGMOD 2009»
16 years 7 months ago
Keyword search on structured and semi-structured data
Empowering users to access databases using simple keywords can relieve the users from the steep learning curve of mastering a structured query language and understanding complex a...
Yi Chen, Wei Wang 0011, Ziyang Liu, Xuemin Lin
SIGMOD
2009
ACM
140views Database» more  SIGMOD 2009»
16 years 7 months ago
Distributed data-parallel computing using a high-level programming language
The Dryad and DryadLINQ systems offer a new programming model for large scale data-parallel computing. They generalize previous execution environments such as SQL and MapReduce in...
Michael Isard, Yuan Yu
SIGMOD
2009
ACM
167views Database» more  SIGMOD 2009»
16 years 7 months ago
Exploring schema repositories with schemr
Schemr is a schema search engine, and provides users the ability to search for and visualize schemas stored in a metadata repository. Users may search by keywords and by example ?...
Kuang Chen, Jayant Madhavan, Alon Y. Halevy
SIGMOD
2008
ACM
134views Database» more  SIGMOD 2008»
16 years 6 months ago
SystemT: a system for declarative information extraction
As applications within and outside the enterprise encounter increasing volumes of unstructured data, there has been renewed interest in the area of information extraction (IE) ? t...
Rajasekar Krishnamurthy, Yunyao Li, Sriram Raghava...
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
16 years 6 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang
« Prev « First page 1814 / 2125 Last » Next »