Sciweavers

6650 search results - page 93 / 1330
» Mutating database queries
Sort
View
151
Voted
ICDE
2009
IEEE
155views Database» more  ICDE 2009»
15 years 10 months ago
SPROUT: Lazy vs. Eager Query Plans for Tuple-Independent Probabilistic Databases
— A paramount challenge in probabilistic databases is the scalable computation of confidences of tuples in query results. This paper introduces an efficient secondary-storage o...
Dan Olteanu, Jiewen Huang, Christoph Koch
CAISE
2005
Springer
15 years 9 months ago
Estimating Recall and Precision for Vague Queries in Databases
In vague queries, a user enters a value that represents some real world object and expects as the result the set of database values that represent this real world object even with ...
Raquel Kolitski Stasiu, Carlos A. Heuser, Roberto ...
121
Voted
IDEAS
1999
IEEE
130views Database» more  IDEAS 1999»
15 years 7 months ago
A Heuristics-Based Approach to Query Optimization in Structured Document Databases
The number of documents published via WWW in form of SGML/HTML has been rapidly growing for years. Efficient, declarative access mechanisms for this type of documents
Dunren Che, Karl Aberer
SIGMOD
2009
ACM
148views Database» more  SIGMOD 2009»
16 years 3 months ago
Combining keyword search and forms for ad hoc querying of databases
A common criticism of database systems is that they are hard to query for users uncomfortable with a formal query language. To address this problem, form-based interfaces and keyw...
Eric Chu, Akanksha Baid, Xiaoyong Chai, AnHai Doan...
155
Voted
SIGMOD
2012
ACM
202views Database» more  SIGMOD 2012»
13 years 5 months ago
MCJoin: a memory-constrained join for column-store main-memory databases
There exists a need for high performance, read-only mainmemory database systems for OLAP-style application scenarios. Most of the existing works in this area are centered around t...
Steven Keith Begley, Zhen He, Yi-Ping Phoebe Chen