Sciweavers

6654 search results - page 1001 / 1331
» Querying Faceted Databases
Sort
View
221
Voted
PODS
2006
ACM
217views Database» more  PODS 2006»
16 years 6 months ago
A simpler and more efficient deterministic scheme for finding frequent items over sliding windows
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
Lap-Kei Lee, H. F. Ting
EDBT
2002
ACM
132views Database» more  EDBT 2002»
16 years 6 months ago
A Framework for the Physical Design Problem for Data Synopses
Maintaining statistics on multidimensional data distributions is crucial for predicting the run-time and result size of queries and data analysis tasks with acceptable accuracy. To...
Arnd Christian König, Gerhard Weikum
EDBT
2006
ACM
112views Database» more  EDBT 2006»
16 years 6 months ago
Expressiveness and Performance of Full-Text Search Languages
We study the expressiveness and performance of full-text search languages. Our main motivation is to provide a formal basis for comparing such languages and to develop a model for...
Chavdar Botev, Sihem Amer-Yahia, Jayavel Shanmugas...
EDBT
2006
ACM
135views Database» more  EDBT 2006»
16 years 6 months ago
A New Design for a Native XML Storage and Indexing Manager
This paper describes the design and implementation of an XML storage manager for fast and interactive XPath expressions evaluation. This storage manager has two main parts: the XML...
Jihad Boulos, Shant Karakashian
EDBT
2006
ACM
150views Database» more  EDBT 2006»
16 years 6 months ago
Improving the Efficiency of XPath Execution on Relational Systems
: This work describes a method for processing XPath on a relational back-end that significantly limits the number of SQL joins required, takes advantage of the strengths of modern ...
Haris Georgiadis, Vasilis Vassalos
« Prev « First page 1001 / 1331 Last » Next »