Sciweavers

1286 search results - page 112 / 258
» Scalable Package Queries in Relational Database Systems
Sort
View
VLDB
2004
ACM
173views Database» more  VLDB 2004»
15 years 3 months ago
Enhancing P2P File-Sharing with an Internet-Scale Query Processor
In this paper, we address the problem of designing a scalable, accurate query processor for peerto-peer filesharing and similar distributed keyword search systems. Using a global...
Boon Thau Loo, Joseph M. Hellerstein, Ryan Huebsch...
SARA
2007
Springer
15 years 4 months ago
Extensional Reasoning
Relational databases have had great industrial success in computer science, their power evidenced by theoretical analysis and widespread adoption. Often, automated theorem provers...
Timothy L. Hinrichs
DL
2000
Springer
162views Digital Library» more  DL 2000»
15 years 2 months ago
Snowball: extracting relations from large plain-text collections
Text documents often contain valuable structured data that is hidden in regular English sentences. This data is best exploited if available as a relational table that we could use...
Eugene Agichtein, Luis Gravano
IDEAS
1999
IEEE
175views Database» more  IDEAS 1999»
15 years 2 months ago
A Parallel Scalable Infrastructure for OLAP and Data Mining
Decision support systems are important in leveraging information present in data warehouses in businesses like banking, insurance, retail and health-care among many others. The mu...
Sanjay Goil, Alok N. Choudhary
PODS
2006
ACM
196views Database» more  PODS 2006»
15 years 10 months ago
The containment problem for REAL conjunctive queries with inequalities
Query containment is a fundamental algorithmic problem in database query processing and optimization. Under set semantics, the query-containment problem for conjunctive queries ha...
T. S. Jayram, Phokion G. Kolaitis, Erik Vee