Sciweavers

470 search results - page 65 / 94
» Privacy-Preserving Queries over Relational Databases
Sort
View
ICDE
2010
IEEE
224views Database» more  ICDE 2010»
14 years 8 months ago
Probabilistic Declarative Information Extraction
Abstract-Unstructured text represents a large fraction of the world's data. It often contain snippets of structured information within them (e.g., people's names and zip ...
Daisy Zhe Wang, Eirinaios Michelakis, Joseph M. He...
SIGMOD
1997
ACM
180views Database» more  SIGMOD 1997»
14 years 24 days ago
Online Aggregation
Aggregation in traditional database systems is performed in batch mode: a query is submitted, the system processes a large volume of data over a long period of time, and, eventual...
Joseph M. Hellerstein, Peter J. Haas, Helen J. Wan...
SIGMOD
2011
ACM
150views Database» more  SIGMOD 2011»
12 years 11 months ago
WHAM: a high-throughput sequence alignment method
Over the last decade the cost of producing genomic sequences has dropped dramatically due to the current so called “next-gen” sequencing methods. However, these next-gen seque...
Yinan Li, Allison Terrell, Jignesh M. Patel
HICSS
1996
IEEE
74views Biometrics» more  HICSS 1996»
14 years 24 days ago
Querying Structured Hyperdocuments
In this paper, we present a document model which integrates the logical structure and hypertext link structure of hyperdocuments in order to manage structured documents with hyper...
Yong Kyu Lee, Seong-Joon Yoo, Kyoungro Yoon, P. Br...
VLDB
2000
ACM
155views Database» more  VLDB 2000»
14 years 5 days ago
ICICLES: Self-Tuning Samples for Approximate Query Answering
Approximate query answering systems provide very fast alternatives to OLAP systems when applications are tolerant to small errors in query answers. Current sampling-based approach...
Venkatesh Ganti, Mong-Li Lee, Raghu Ramakrishnan