Sciweavers

5221 search results - page 237 / 1045
» An On-line Problem Database
Sort
View
DEXAW
2005
IEEE
116views Database» more  DEXAW 2005»
16 years 6 days ago
Towards Self-Predicting Systems: What If You Could Ask "What-If"?
Today, management and tuning questions are approached using if...then... rules of thumb. This reactive approach requires expertise regarding of system behavior, making it difficu...
Eno Thereska, Dushyanth Narayanan, Gregory R. Gang...
ICDT
2003
ACM
91views Database» more  ICDT 2003»
15 years 11 months ago
Reformulation of XML Queries and Constraints
We state and solve the query reformulation problem for XML publishing in a general setting that allows mixed (XML and relational) storage for the proprietary data and exploits redu...
Alin Deutsch, Val Tannen
ICDT
2003
ACM
127views Database» more  ICDT 2003»
15 years 11 months ago
On Reasoning about Structural Equality in XML: A Description Logic Approach
We define a boolean complete description logic dialect called DLFDreg that can be used to reason about structural equality in semistructured ordered data in the presence of docume...
David Toman, Grant E. Weddell
SSD
2001
Springer
112views Database» more  SSD 2001»
15 years 11 months ago
K-Nearest Neighbor Search for Moving Query Point
Abstract. This paper addresses the problem of finding k nearest neighbors for moving query point (we call it k-NNMP). It is an important issue in both mobile computing research an...
Zhexuan Song, Nick Roussopoulos
CLEANDB
2006
ACM
112views Database» more  CLEANDB 2006»
15 years 10 months ago
Generic Entity Resolution with Data Confidences
We consider the Entity Resolution (ER) problem (also known as deduplication, or merge-purge), in which records determined to represent the same real-world entity are successively ...
David Menestrina, Omar Benjelloun, Hector Garcia-M...