Sciweavers

83 search results - page 15 / 17
» Factorizing Complex Predicates in Queries to Exploit Indexes
Sort
View
SIGMOD
2012
ACM
253views Database» more  SIGMOD 2012»
11 years 10 months ago
Skew-aware automatic database partitioning in shared-nothing, parallel OLTP systems
The advent of affordable, shared-nothing computing systems portends a new class of parallel database management systems (DBMS) for on-line transaction processing (OLTP) applicatio...
Andrew Pavlo, Carlo Curino, Stanley B. Zdonik
SIGSOFT
2009
ACM
14 years 8 months ago
Engineering search computing applications: vision and challenges
Search computing is a novel discipline whose goal is to answer complex, multi-domain queries. Such queries typically require combining in their results domain knowledge extracted ...
Marco Brambilla, Stefano Ceri
CAISE
2010
Springer
13 years 6 months ago
Search Computing Systems
Search computing is a novel discipline whose goal is to answer complex, multi-domain queries. Such queries typically require combining in their results domain knowledge extracted ...
Stefano Ceri, Marco Brambilla
TREC
2003
13 years 9 months ago
Passage Scoring for Question Answering via Bayesian Inference on Lexical Relations
Many researchers have used lexical networks and ontologies to mitigate synonymy and polysemy problems in Question Answering (QA), systems coupled with taggers, query classifiers,...
Deepa Paranjpe, Ganesh Ramakrishnan, Sumana Sriniv...
XSYM
2004
Springer
129views Database» more  XSYM 2004»
14 years 1 months ago
Fractional XSketch Synopses for XML Databases
A key step in the optimization of declarative queries over XML data is estimating the selectivity of path expressions, i.e., the number of elements reached by a specific navigatio...
Natasha Drukh, Neoklis Polyzotis, Minos N. Garofal...