Sciweavers

1248 search results - page 49 / 250
» Querying and Updating the File
Sort
View
SIGMOD
2005
ACM
254views Database» more  SIGMOD 2005»
14 years 8 months ago
Conceptual Partitioning: An Efficient Method for Continuous Nearest Neighbor Monitoring
Given a set of objects P and a query point q, a k nearest neighbor (k-NN) query retrieves the k objects in P that lie closest to q. Even though the problem is well-studied for sta...
Kyriakos Mouratidis, Marios Hadjieleftheriou, Dimi...
PODS
2006
ACM
116views Database» more  PODS 2006»
14 years 8 months ago
Relational lenses: a language for updatable views
We propose a novel approach to the classical view update problem. The view update problem arises from the fact that modifications to a database view may not correspond uniquely to...
Aaron Bohannon, Benjamin C. Pierce, Jeffrey A. Vau...
ICDE
2010
IEEE
244views Database» more  ICDE 2010»
14 years 8 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
DELOS
2000
13 years 10 months ago
Challenging Ubiquitous Inverted Files
Stand-alone ranking systems based on highly optimized inverted file structures are generally considered `the' solution for building search engines. Observing various developm...
Arjen P. de Vries
ICDT
2009
ACM
119views Database» more  ICDT 2009»
14 years 9 months ago
Incremental XPath evaluation
We study the problem of incrementally maintaining an XPath query on an XML database under updates. The updates we consider are node insertion, node deletion, and node relabeling. ...
Henrik Björklund, Marcel Marquardt, Wim Marte...