Sciweavers

365 search results - page 50 / 73
» Answering Non-Monotonic Queries in Relational Data Exchange
Sort
View
SIGMOD
2005
ACM
100views Database» more  SIGMOD 2005»
15 years 9 months ago
A Disk-Based Join With Probabilistic Guarantees
One of the most common operations in analytic query processing is the application of an aggregate function to the result of a relational join. We describe an algorithm for computi...
Chris Jermaine, Alin Dobra, Subramanian Arumugam, ...
DEXAW
2007
IEEE
142views Database» more  DEXAW 2007»
14 years 11 months ago
Synopsis Data Structures for XML Databases: Models, Issues, and Research Perspectives
Due to the lack of efficient native XML database management systems, XML data manipulation and query evaluation may be resource-consuming, and represent a bottleneck for several ...
Angela Bonifati, Alfredo Cuzzocrea
76
Voted
KDD
1997
ACM
111views Data Mining» more  KDD 1997»
15 years 1 months ago
SIPping from the Data Firehose
When mining large databases, the data extraction problem and the interface between the database and data mining algorithm become important issues. Rather than giving a mining algo...
George H. John, Brian Lent
101
Voted
ICICS
2007
Springer
15 years 1 months ago
Time and Space Efficient Algorithms for Two-Party Authenticated Data Structures
Authentication is increasingly relevant to data management. Data is being outsourced to untrusted servers and clients want to securely update and query their data. For example, in ...
Charalampos Papamanthou, Roberto Tamassia
68
Voted
VLDB
1997
ACM
86views Database» more  VLDB 1997»
15 years 1 months ago
Using Probabilistic Information in Data Integration
The goal of a mediator system is to provide users a uniform interface to the multitude of information sources. To translate user queries, given in a mediated schema, to queries on...
Daniela Florescu, Daphne Koller, Alon Y. Levy