Sciweavers

6650 search results - page 251 / 1330
» Mutating database queries
Sort
View
SIGMOD
2005
ACM
254views Database» more  SIGMOD 2005»
16 years 4 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...
XIMEP
2006
ACM
194views Database» more  XIMEP 2006»
15 years 10 months ago
Template Folding for XPath
We discuss query evaluation for XML-based server systems where the same query is evaluated on every incoming XML message. In a typical scenario, many of the incoming messages will...
Carl-Christian Kanne, Guido Moerkotte
ICDE
2010
IEEE
202views Database» more  ICDE 2010»
16 years 4 months ago
Ranked Queries over Sources with Boolean Query Interfaces without Ranking Support
Many online or local data sources provide powerful querying mechanisms but limited ranking capabilities. For instance, PubMed allows users to submit highly expressive Boolean keywo...
Panagiotis G. Ipeirotis, Vagelis Hristidis, Yuheng...
ICDE
1998
IEEE
119views Database» more  ICDE 1998»
16 years 5 months ago
Processing Incremental Multidimensional Range Queries in a Direct Manipulation Visual Query
We have developed a MultiMedia Visual Information Seeking (MMVIS) Environment that is the first system to support an integrated approach to the direct manipulation specification o...
Stacie Hibino, Elke A. Rundensteiner
ICDM
2006
IEEE
114views Data Mining» more  ICDM 2006»
15 years 10 months ago
Incremental Mining of Frequent Query Patterns from XML Queries for Caching
Existing studies for mining frequent XML query patterns mainly introduce a straightforward candidate generate-and-test strategy and compute frequencies of candidate query patterns...
Guoliang Li, Jianhua Feng, Jianyong Wang, Yong Zha...