Sciweavers

951 search results - page 36 / 191
» Groupwise Processing of Relational Queries
Sort
View
WWW
2006
ACM
15 years 10 months ago
Generating query substitutions
We introduce the notion of query substitution, that is, generating a new query to replace a user's original search query. Our technique uses modifications based on typical su...
Rosie Jones, Benjamin Rey, Omid Madani, Wiley Grei...
SIGMOD
2007
ACM
121views Database» more  SIGMOD 2007»
15 years 10 months ago
EaseDB: a cache-oblivious in-memory query processor
We propose to demonstrate EaseDB, the first cache-oblivious query processor for in-memory relational query processing. The cacheoblivious notion from the theory community refers t...
Bingsheng He, Yinan Li, Qiong Luo, Dongqing Yang
DEBU
2008
123views more  DEBU 2008»
14 years 10 months ago
Pathfinder: XQuery Off the Relational Shelf
The Pathfinder project makes inventive use of relational database technology--originally developed to process data of strictly tabular shape--to construct efficient database-suppo...
Torsten Grust, Jan Rittinger, Jens Teubner
ICDE
2007
IEEE
128views Database» more  ICDE 2007»
15 years 11 months ago
SQL Queries Over Unstructured Text Databases
Text documents often embed data that is structured in nature. By processing a text database with information extraction systems, we can define a variety of structured "relati...
Alpa Jain, AnHai Doan, Luis Gravano
SIGMOD
2007
ACM
225views Database» more  SIGMOD 2007»
15 years 10 months ago
From complete to incomplete information and back
Incomplete information arises naturally in numerous data management applications. Recently, several researchers have studied query processing in the context of incomplete informat...
Lyublena Antova, Christoph Koch, Dan Olteanu