Sciweavers

51 search results - page 10 / 11
» Engineering the compression of massive tables: an experiment...
Sort
View
ER
2005
Springer
200views Database» more  ER 2005»
13 years 11 months ago
How to Tame a Very Large ER Diagram (Using Link Analysis and Force-Directed Drawing Algorithms)
Abstract. Understanding a large schema without the assistance of persons already familiar with it (and its associated applications), is a hard and very time consuming task that occ...
Yannis Tzitzikas, Jean-Luc Hainaut
SIGMOD
2008
ACM
145views Database» more  SIGMOD 2008»
14 years 6 months ago
Optimizing complex queries with multiple relation instances
Today's query processing engines do not take advantage of the multiple occurrences of a relation in a query to improve performance. Instead, each instance is treated as a dis...
Yu Cao, Gopal C. Das, Chee Yong Chan, Kian-Lee Tan
ANCS
2009
ACM
13 years 4 months ago
SPC-FA: synergic parallel compact finite automaton to accelerate multi-string matching with low memory
Deterministic Finite Automaton (DFA) is well-known for its constant matching speed in worst case, and widely used in multistring matching, which is a critical technique in high pe...
Junchen Jiang, Yi Tang, Bin Liu, Xiaofei Wang, Yan...
SIGIR
2012
ACM
11 years 8 months ago
Explanatory semantic relatedness and explicit spatialization for exploratory search
Exploratory search, in which a user investigates complex concepts, is cumbersome with today’s search engines. We present a new exploratory search approach that generates interac...
Brent Hecht, Samuel Carton, Mahmood Quaderi, Johan...
VEE
2009
ACM
107views Virtualization» more  VEE 2009»
14 years 1 months ago
Architectural support for shadow memory in multiprocessors
Runtime monitoring support serves as a foundation for the important tasks of providing security, performing debugging, and improving performance of applications. Often runtime mon...
Vijay Nagarajan, Rajiv Gupta