Sciweavers

18306 search results - page 3021 / 3662
» Algorithmics in Exponential Time
Sort
View
ICDE
2006
IEEE
144views Database» more  ICDE 2006»
16 years 7 months ago
Materialized Sample Views for Database Approximation
We consider the problem of creating a sample view of a database table. A sample view is an indexed, materialized view that permits efficient sampling from an arbitrary range query...
Shantanu Joshi, Chris Jermaine
ICDE
2005
IEEE
161views Database» more  ICDE 2005»
16 years 7 months ago
Network-Based Problem Detection for Distributed Systems
We introduce a network-based problem detection framework for distributed systems, which includes a data-mining method for discovering dynamic dependencies among distributed servic...
Hisashi Kashima, Tadashi Tsumura, Tsuyoshi Id&eacu...
ICDE
2005
IEEE
240views Database» more  ICDE 2005»
16 years 7 months ago
Adaptive Processing of Top-K Queries in XML
The ability to compute top-k matches to XML queries is gaining importance due to the increasing number of large XML repositories. The efficiency of top-k query evaluation relies o...
Amélie Marian, Divesh Srivastava, Nick Koud...
ICDE
2004
IEEE
101views Database» more  ICDE 2004»
16 years 7 months ago
Personalization of Queries in Database Systems
As information becomes available in increasing amounts to a wide spectrum of users, the need for a shift towards a more user-centered information access paradigm arises. We develo...
Georgia Koutrika, Yannis E. Ioannidis
ICDE
2004
IEEE
105views Database» more  ICDE 2004»
16 years 7 months ago
SPINE: Putting Backbone into String Indexing
The indexing technique commonly used for long strings, such as genomes, is the suffix tree, which is based on a vertical (intra-path) compaction of the underlying trie structure. ...
Naresh Neelapala, Romil Mittal, Jayant R. Haritsa
« Prev « First page 3021 / 3662 Last » Next »