Sciweavers

2001 search results - page 222 / 401
» Indexing in a Hypertext Database
Sort
View
KDD
2009
ACM
169views Data Mining» more  KDD 2009»
14 years 5 months ago
On burstiness-aware search for document sequences
As the number and size of large timestamped collections (e.g. sequences of digitized newspapers, periodicals, blogs) increase, the problem of efficiently indexing and searching su...
Theodoros Lappas, Benjamin Arai, Manolis Platakis,...
SSDBM
2007
IEEE
172views Database» more  SSDBM 2007»
14 years 5 months ago
Enabling Real-Time Querying of Live and Historical Stream Data
Applications that query data streams in order to identify trends, patterns, or anomalies can often benefit from comparing the live stream data with archived historical stream dat...
Frederick Reiss, Kurt Stockinger, Kesheng Wu, Arie...
SPIRE
2005
Springer
14 years 4 months ago
Using the k-Nearest Neighbor Graph for Proximity Searching in Metric Spaces
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
Rodrigo Paredes, Edgar Chávez
VLDB
2005
ACM
122views Database» more  VLDB 2005»
14 years 4 months ago
C-Store: A Column-oriented DBMS
This paper presents the design of a read-optimized relational DBMS that contrasts sharply with most current systems, which are write-optimized. Among the many differences in its d...
Michael Stonebraker, Daniel J. Abadi, Adam Batkin,...
DBKDA
2010
IEEE
169views Database» more  DBKDA 2010»
14 years 3 months ago
XLeaf: Twig Evaluation with Skipping Loop Joins and Virtual Nodes
Abstract—XML indexing and search has become an important topic, and twig joins are key building blocks in XML search systems. This paper describes a novel approach using a nested...
Nils Grimsmo, Truls Amundsen Bjørklund, &Os...