SIGMOD 2009 - PDF Preprint Papers

SIGMOD 2009 International Conference on Management of Data

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed SIGMOD-2009 Paper

click to vote

SIGMOD
2009
ACM

476views Database» more SIGMOD 2009»

MobileMiner: a real world case study of data mining in mobile communication

14 years 6 months ago

Download www.cs.sfu.ca

Mobile communication data analysis has been often used as a background application to motivate many data mining problems. However, very few data mining researchers have a chance t...

Tengjiao Wang, Bishan Yang, Jun Gao, Dongqing Yang...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	476	MobileMiner: a real world case study of data mining in mobile communication	claim
2	291	Partial join order optimization in the paraccel analytic database	claim
3	269	Efficient approximate entity extraction with edit distance constraints	claim
4	258	Continuous obstructed nearest neighbor queries in spatial databases	claim
5	250	Query processing techniques for solid state drives	claim
6	250	MayBMS: a probabilistic database management system	claim
7	235	Quality and efficiency in high dimensional nearest neighbor search	claim
8	228	Interactive anonymization of sensitive data	claim
9	220	Keyword search in databases: the power of RDBMS	claim
10	219	Hermes: a travel through semantics on the data web	claim
11	218	Exploring biomedical databases with BioNav	claim
12	218	DejaVu: declarative pattern matching over live and archived streams of events	claim
13	215	Efficient type-ahead search on relational data: a TASTIER approach	claim
14	214	DDE: from dewey to a fully dynamic XML labeling scheme	claim
15	213	Dictionary-based order-preserving string compression for main memory column stores	claim
16	202	A comparison of flexible schemas for software as a service	claim
17	202	ZStream: a cost-based query processor for adaptively detecting composite events	claim
18	201	Cost based plan selection for xpath	claim
19	198	Monitoring path nearest neighbor in road networks	claim
20	197	Secure kNN computation on encrypted databases	claim
21	194	Building community-centric information exploration applications on social content sites	claim
22	192	Scalable join processing on very large RDF graphs	claim
23	192	A gauss function based approach for unbalanced ontology matching	claim
24	191	Scalable skyline computation using object-based space partitioning	claim
25	190	Augmented social cognition: using social web technology to enhance the ability of groups to remember, think, and reason	claim
26	190	DataLens: making a good first impression	claim
27	190	Optimizing complex extraction programs over evolving text data	claim
28	189	Query segmentation using conditional random fields	claim
29	189	Generic and effective semi-structured keyword search	claim
30	186	What's on the grapevine?	claim
31	185	Attacks on privacy and deFinetti's theorem	claim
32	184	Minimizing the communication cost for continuous skyline maintenance	claim
33	182	3-HOP: a high-compression indexing scheme for reachability query	claim
34	180	Indexing correlated probabilistic databases	claim
35	177	ORDEN: outlier region detection and exploration in sensor networks	claim
36	177	Exploiting context analysis for combining multiple entity resolution systems	claim
37	175	QoX-driven ETL design: reducing the cost of ETL consulting engagements	claim
38	175	Keyword search on structured and semi-structured data	claim
39	175	Ranking distributed probabilistic data	claim
40	172	Self-organizing tuple reconstruction in column-stores	claim
41	171	Secure outsourced aggregation via one-way chains	claim
42	171	GAMPS: compressing multi sensor data by grouping and amplitude scaling	claim
43	171	Peta-scale data warehousing at Yahoo!	claim
44	168	Database research in computer games	claim
45	167	Exploring schema repositories with schemr	claim
46	167	HDSampler: revealing data behind web form interfaces	claim
47	165	Query by output	claim
48	161	Automated SQL tuning through trial and (sometimes) error	claim
49	161	Cross-tier, label-based security enforcement for web applications	claim
50	161	Dependency-aware reordering for parallelizing query optimization in multi-core CPUs	claim
51	158	Simplifying XML schema: effortless handling of nondeterministic regular expressions	claim
52	157	FPGA: what's in it for a database?	claim
53	157	Asynchronous view maintenance for VLSD databases	claim
54	157	Authenticated join processing in outsourced databases	claim
55	155	Efficient top-k algorithms for fuzzy search in string collections	claim
56	153	ELMR: lightweight mobile health records	claim
57	150	DBDOC: querying and browsing databases and interrelated documents	claim
58	149	CourseRank: a social system for course planning	claim
59	148	Combining keyword search and forms for ad hoc querying of databases	claim
60	147	XML keyword query refinement	claim
61	146	A common database approach for OLTP and OLAP using an in-memory column database	claim
62	144	Do we mean the same?: disambiguation of extracted keyword queries for database search	claim
63	143	Data integration in mashups	claim
64	143	Building search applications with Marklogic Server	claim
65	142	A grammar-based entity representation framework for data cleaning	claim
66	142	Voyagers and voyeurs: supporting social data analysis	claim
67	141	Rethinking cost and performance of database systems	claim
68	141	FlexRecs: expressing and combining flexible recommendations	claim
69	140	Estimating the confidence of conditional functional dependencies	claim
70	140	Distributed data-parallel computing using a high-level programming language	claim
71	140	Robust web extraction: an approach based on a probabilistic tree-edit model	claim
72	139	Detecting and resolving unsound workflow views for correct provenance analysis	claim
73	139	Vispedia: on-demand data integration for interactive visualization and exploration	claim
74	138	PRIMA: archiving and querying historical data with evolving schemas	claim
75	137	Robust and efficient algorithms for rank join evaluation	claim
76	137	Advances in flash memory SSD technology for enterprise database applications	claim
77	137	Entity resolution with iterative blocking	claim
78	137	Enabling enterprise mashups over unstructured text feeds with InfoSphere MashupHub and SystemT	claim
79	137	Privacy preservation of aggregates in hidden databases: why and how?	claim
80	136	A comparison of approaches to large-scale data analysis	claim
81	136	Optimizing i/o-intensive transactions in highly interactive applications	claim
82	135	Interactive plan hints for query optimization	claim
83	134	Keyword query cleaning using hidden Markov models	claim
84	134	Extending autocompletion to tolerate errors	claim
85	133	Hierarchical result views for keyword queries over relational databases	claim
86	132	Taming the storage dragon: the adventures of hoTMaN	claim
87	132	Core schema mappings	claim
88	132	Generating example data for dataflow programs	claim
89	130	FlashLogging: exploiting flash devices for synchronous logging performance	claim
90	129	Incremental maintenance of length normalized indexes for approximate string matching	claim
91	125	Top-k queries on uncertain data: on score distribution and typical answers	claim
92	122	Logical foundations of relational data exchange	claim
93	122	Finding min-repros in database software	claim
94	121	Query-aware shrinking test databases	claim
95	120	Query interactions in database workloads	claim
96	120	Kernel-based skyline cardinality estimation	claim
97	119	Search your memory ! - an associative memory based desktop search system	claim
98	117	MEDIALIFE: from images to a life chronicle	claim
99	117	FERRY: database-supported program execution	claim
100	114	A framework for testing query transformation rules	claim
101	112	How is the weather tomorrow?: towards a benchmark for the cloud	claim
102	112	Design for interaction	claim
103	111	Language-model-based ranking in entity-relation graphs	claim
104	106	SmartCIS: integrating digital and physical environments	claim
105	105	A first study on strategies for generating workflow snippets	claim
106	100	ROX: run-time optimization of XQueries	claim
107	91	Secondary-storage confidence computation for conjunctive queries with inequalities	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers