Sciweavers

101 search results - page 13 / 21
» Partitioning techniques for fine-grained indexing
Sort
View
SIGMOD
2007
ACM
232views Database» more  SIGMOD 2007»
14 years 9 months ago
BLINKS: ranked keyword searches on graphs
Query processing over graph-structured data is enjoying a growing number of applications. Keyword search on a graph finds a set of answers, each of which is a substructure of the ...
Haixun Wang, Hao He, Jun Yang 0001, Philip S. Yu
CIKM
2010
Springer
13 years 8 months ago
Hypergraph-based multilevel matrix approximation for text information retrieval
In Latent Semantic Indexing (LSI), a collection of documents is often pre-processed to form a sparse term-document matrix, followed by a computation of a low-rank approximation to...
Haw-ren Fang, Yousef Saad
ICDE
2001
IEEE
104views Database» more  ICDE 2001»
14 years 11 months ago
Efficient Bulk Deletes in Relational Databases
Many applications require that large amounts of data are deleted from the database ? typically, such bulk deletes are carried out periodically and involve old or out-of-date data....
Andreas Gärtner, Alfons Kemper, Donald Kossma...
WWW
2006
ACM
14 years 10 months ago
FLUX: fuzzy content and structure matching of XML range queries
An XML range query may impose predicates on the numerical or textual contents of the elements and/or their respective path structures. In order to handle content and structure ran...
Hua-Gang Li, S. Alireza Aghili, Divyakant Agrawal,...
DBKDA
2010
IEEE
169views Database» more  DBKDA 2010»
14 years 2 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...