Sciweavers

470 search results - page 89 / 94
» Privacy-Preserving Queries over Relational Databases
Sort
View
ICDE
2010
IEEE
244views Database» more  ICDE 2010»
14 years 7 months ago
Propagating Updates Through XML Views Using Lineage Tracing
We address the problem of updating XML views over relational data by translating view updates expressed in the XQuery update facility to embedded SQL updates. Although our XML view...
Leonidas Fegaras
VLDB
2002
ACM
154views Database» more  VLDB 2002»
13 years 7 months ago
I/O-Conscious Data Preparation for Large-Scale Web Search Engines
Given that commercial search engines cover billions of web pages, efficiently managing the corresponding volumes of disk-resident data needed to answer user queries quickly is a f...
Maxim Lifantsev, Tzi-cker Chiueh
KDD
2012
ACM
186views Data Mining» more  KDD 2012»
11 years 10 months ago
Maximum inner-product search using cone trees
The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...
Parikshit Ram, Alexander G. Gray
VLDB
1987
ACM
90views Database» more  VLDB 1987»
13 years 11 months ago
Index Access with a Finite Buffer
: A buffer is a main-memory area used to reduce accessto disks. The buffer holds pages from secondary storage files. A processrequesting a page causesa fault if the pageis not in t...
Giovanni Maria Sacco
EDBT
2009
ACM
116views Database» more  EDBT 2009»
14 years 2 days ago
Ranking objects based on relationships and fixed associations
Text corpora are often enhanced by additional metadata which relate real-world entities, with each document in which such entities are discussed. Such relationships are typically ...
Albert Angel, Surajit Chaudhuri, Gautam Das, Nick ...